Improved bounds for speed scaling in devices obeying the cube-root rule

DOI10.4086/TOC.2012.V008A002zbMATH Open1253.68068OpenAlexW4253784538MaRDI QIDQ2913809FDOQ2913809

Dmitriy Katz, Kirk Pruhs, Ho-Leung Chan, N. Bansal

Publication date: 27 September 2012

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2012.v008a002

zbMATH Keywords

online algorithmsschedulingenergy minimizationspeed-scaling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (6)

• A fully polynomial-time approximation scheme for speed scaling with a sleep state
• Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
• Race to idle
• On multi-processor speed scaling with migration
• Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
• Energy-Efficient Algorithms for Non-preemptive Speed-Scaling

This page was built for publication: Improved bounds for speed scaling in devices obeying the cube-root rule

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913809)