On-line load balancing of temporary tasks revisited
From MaRDI portal
Publication:5958311
DOI10.1016/S0304-3975(00)00392-3zbMath0984.68016MaRDI QIDQ5958311
Tak-Wah Lam, Hing-Fung Ting, Kar-Keung To, Wai-Ha Wong
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved lower bound for load balancing of tasks with unknown duration
- Online algorithms. The state of the art
- Improved bounds for on-line load balancing
- On-Line Load Balancing in a Hierarchical Server Topology
- On-Line Load Balancing of Temporary Tasks
- Bounds for List Schedules on Uniform Processors
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- The Competitiveness of On-Line Assignments
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- On-Line Load Balancing of Temporary Tasks on Identical Machines
- On-Line Load Balancing for Related Machines
- Online load balancing and network flow
- Bounds for Certain Multiprocessing Anomalies