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

DOI10.4086/TOC.2012.V008A002MaRDI QIDQ2913809zbMATH OpenOpenAlexFDO

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

Publication date 27 September 2012

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
• Average Rate Speed Scaling
• Average rate speed scaling
• Speed scaling to manage energy and temperature
• Speed scaling with an arbitrary power function

Cited in

(9)

• A fully polynomial-time approximation scheme for speed scaling with a sleep state
• Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
• Speed scaling for weighted flow time
• Energy-efficient algorithms for non-preemptive speed-scaling
• Average Rate Speed Scaling
• Race to idle: new algorithms for speed scaling with a sleep state
• Average rate speed scaling
• On multi-processor speed scaling with migration
• Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption

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)