Algorithms for Dynamic Speed Scaling

Author Susanne Albers



PDF
Thumbnail PDF

File

LIPIcs.STACS.2011.1.pdf
  • Filesize: 0.51 MB
  • 11 pages

Document Identifiers

Author Details

Susanne Albers

Cite AsGet BibTex

Susanne Albers. Algorithms for Dynamic Speed Scaling. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.STACS.2011.1

Abstract

Many modern microprocessors allow the speed/frequency to be set dynamically. The general goal is to execute a sequence of jobs on a variable-speed processor so as to minimize energy consumption. This paper surveys algorithmic results on dynamic speed scaling. We address settings where (1) jobs have strict deadlines and (2) job flow times are to be minimized.
Keywords
  • competitive analysis
  • energy-efficiency
  • flow time
  • job deadline
  • offline algorithm
  • online algorithm
  • response time
  • scheduling
  • variable-speed proce

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