Speed scaling of processes with arbitrary speedup curves on a multiprocessor
DOI10.1007/S00224-011-9349-0zbMATH Open1253.68070OpenAlexW1965378629MaRDI QIDQ693765FDOQ693765
Authors: Ho-Leung Chan, Jeff Edmonds, Kirk 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
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)
Cites Work
- Nonclairvoyant scheduling
- Speed is as powerful as clairvoyance
- Speed scaling for weighted flow time
- Energy-Efficient Algorithms for Flow Time Minimization
- Scheduling for Speed Bounded Processors
- Scalably scheduling processes with arbitrary speedup curves
- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
- Scheduling in the dark
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
- Algorithm Theory - SWAT 2004
- Nonclairvoyant speed scaling for flow and energy
- Online weighted flow time and deadline scheduling
- Minimizing flow time nonclairvoyantly
- Title not available (Why is that?)
Cited In (7)
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Energy-efficient multiprocessor scheduling for flow time and makespan
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Speed scaling for stretch plus energy
- On multi-processor speed scaling with migration
- Throughput Maximization in Multiprocessor Speed-Scaling
- The effect of multiprocessor radius on scaling
This page was built for publication: Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693765)
