On-line scheduling of parallel jobs on two machines
From MaRDI portal
Publication:954945
Recommendations
Cites work
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Bounds for Certain Multiprocessing Anomalies
- On an on-line scheduling problem for parallel jobs
- On-line scheduling of parallel jobs with runtime restrictions
- Optimal on-line scheduling of parallel jobs with dependencies
- Structural Information and Communication Complexity
Cited in
(39)- Online scheduling of parallel jobs on two machines is 2-competitive
- Online scheduling of mixed CPU-GPU jobs
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Online MapReduce processing on two identical parallel machines
- On-line two-machine job shop scheduling with time lags
- Scheduling Parallel Machines On-Line
- Online scheduling of ordered flow shops
- On-line scheduling revisited
- Online scheduling of parallel jobs with preemption on two identical machines
- On an on-line scheduling problem for parallel jobs
- On-line multi-threaded scheduling
- On-line parallel machine scheduling with special jobs to minimize the makespan
- scientific article; zbMATH DE number 1670547 (Why is no real title available?)
- Online over time processing of combinatorial problems
- Online scheduling of parallel jobs with bounded processing times on two machines
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- scientific article; zbMATH DE number 1817675 (Why is no real title available?)
- Parallel machine scheduling with special jobs
- An online scheduling of two type parallel jobs on identical machines
- Dynamic on-line task scheduling on parallel processors
- On-line scheduling of two parallel machines with a single server
- On-line scheduling of parallel jobs in a list
- Partial servicing of on-line jobs
- Online C-benevolent job scheduling on multiple machines
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
- On-line scheduling of parallel jobs
- Structural Information and Communication Complexity
- Scheduling parallel jobs online with convex and concave parallelizability
- On-line scheduling on parallel machines to minimize the makespan
- On-line scheduling of parallel jobs in heterogeneous multiple clusters
- A system-centric metric for the evaluation of online job schedules
- On-line scheduling of jobs with order arrival time and hard deadline on two parallel identical machines
- scientific article; zbMATH DE number 1088302 (Why is no real title available?)
- Online scheduling of jobs with favorite machines
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- scientific article; zbMATH DE number 1475019 (Why is no real title available?)
- On-line parallel machine scheduling with selective jobs
- On-line scheduling of multi-core processor tasks with virtualization
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
This page was built for publication: On-line scheduling of parallel jobs on two machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954945)