Nonclairvoyant speed scaling for flow and energy
From MaRDI portal
Publication:644794
DOI10.1007/s00453-010-9420-2zbMath1225.68053OpenAlexW2111339397MaRDI QIDQ644794
Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk R. Pruhs
Publication date: 7 November 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-010-9420-2
Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Energy-efficient multiprocessor scheduling for flow time and makespan, Unnamed Item, Speed scaling for stretch plus energy
Cites Work
- Unnamed Item
- Online weighted flow time and deadline scheduling
- Nonclairvoyant scheduling
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
- Scalably scheduling processes with arbitrary speedup curves
- Minimizing flow time nonclairvoyantly
- Scheduling for Speed Bounded Processors
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Speed is as powerful as clairvoyance
- Algorithm Theory - SWAT 2004
- Energy-Efficient Algorithms for Flow Time Minimization
- Scheduling in the dark