Document Open Access Logo

Polynomial Time Algorithms for Minimum Energy Scheduling

Authors Marek Chrobak, Philippe Baptiste, Christoph Dürr



PDF
Thumbnail PDF

File

DagSemProc.10071.8.pdf
  • Filesize: 233 kB
  • 12 pages

Document Identifiers

Author Details

Marek Chrobak
Philippe Baptiste
Christoph Dürr

Cite AsGet BibTex

Marek Chrobak, Philippe Baptiste, and Christoph Dürr. Polynomial Time Algorithms for Minimum Energy Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, pp. 1-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.10071.8

Abstract

The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time is long enough to compensate for this additional energy expenditure. In the specific problem studied in the paper, we have a set of jobs with release times and deadlines that need to be executed on a single processor. Preemptions are allowed. The processor requires energy L to be woken up and, when it is on, it uses the energy at a rate of R units per unit of time. It has been an open problem whether a schedule minimizing the overall energy consumption can be computed in polynomial time. We solve this problem in positive, by providing an O(n5)-time algorithm. In addition we provide an O(n4)-time algorithm for computing the minimum energy schedule when all jobs have unit length.
Keywords
  • Scheduling
  • algorithm
  • dynamic programming
  • energy

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail