Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines
From MaRDI portal
Publication:3010382
DOI10.1007/978-3-642-20877-5_4zbMath1330.68038OpenAlexW1940477620MaRDI QIDQ3010382
Prudence W. H. Wong, Paul C. Bell
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.lboro.ac.uk/2134/18803
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deadline scheduling and power management for speed bounded processors
- The bell is ringing in speed-scaled multiprocessor scheduling
- Optimizing throughput and energy in online deadline scheduling
- Speed Scaling with an Arbitrary Power Function
- Scheduling for Speed Bounded Processors
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Speed scaling to manage energy and temperature
- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
- Energy-Efficient Algorithms for Flow Time Minimization
- The Arithmetic of Bell and Stirling Numbers