Speed scaling of processes with arbitrary speedup curves on a multiprocessor
From MaRDI portal
Publication:693765
DOI10.1007/s00224-011-9349-0zbMath1253.68070OpenAlexW1965378629MaRDI QIDQ693765
Ho-Leung Chan, Jeff Edmonds, Kirk R. Pruhs
Publication date: 10 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9349-0
Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Energy-efficient multiprocessor scheduling for flow time and makespan, Speed scaling for stretch plus energy
Cites Work
- Unnamed Item
- 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
- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Speed is as powerful as clairvoyance
- Algorithm Theory - SWAT 2004
- Nonclairvoyant Speed Scaling for Flow and Energy
- Energy-Efficient Algorithms for Flow Time Minimization
- Scheduling in the dark