Energy optimal schedules for jobs with multiple active intervals

DOI10.1016/J.TCS.2009.11.002MaRDI QIDQ844896zbMATH OpenOpenAlexFDO

Authors Wanyong Tian, Minming Li, Enhong Chen

Publication date 5 February 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.11.002

zbMATH Keywords

dynamic voltage scalingmin-energy schedulemultiple interval jobs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• LP rounding and combinatorial algorithms for minimizing active and busy time
• Scheduling to minimize gaps and power consumption
• Active and busy time scheduling problem: a survey

Cites work

• scientific article; zbMATH DE number 6381709 (Why is no real title available?)
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• A Fast Parametric Maximum Flow Algorithm and Applications
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
• Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
• On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
• Scheduling for Speed Bounded Processors
• Speed scaling to manage energy and temperature
• Speed scaling with an arbitrary power function

Cited in

(1)

• Machine speed scaling by adapting methods for convex optimization with submodular constraints

This page was built for publication: Energy optimal schedules for jobs with multiple active intervals

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