Improved multi-processor scheduling for flow time and energy
From MaRDI portal
Publication:2434271
DOI10.1007/s10951-009-0145-5zbMath1280.68074WikidataQ58062893 ScholiaQ58062893MaRDI QIDQ2434271
Prudence W. H. Wong, Isaac K. K. To, Lap-Kei Lee, Tak-Wah Lam
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0145-5
energy minimization; competitive analysis; dynamic speed scaling; multi-processor scheduling; online scheduling algorithms
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Speed scaling on parallel processors, Energy efficient scheduling of parallelizable jobs, Models and algorithms for energy-efficient scheduling with immediate start of jobs
Cites Work
- Minimizing total flow time and total completion time with immediate dispatching
- Speed scaling of tasks with precedence constraints
- Power-aware scheduling for makespan and flow
- Approximating total flow time on parallel machines
- Eliminating Migration in Multi-processor Scheduling
- Minimizing the Flow Time Without Migration
- Scheduling for Speed Bounded Processors
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Speed scaling to manage energy and temperature
- Multi-processor scheduling to minimize flow time with ε resource augmentation
- Algorithms for minimizing weighted flow time
- Algorithm Theory - SWAT 2004
- Nonmigratory Online Deadline Scheduling on Multiprocessors
- Energy-Efficient Algorithms for Flow Time Minimization
- Optimal time-critical scheduling via resource augmentation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
