Algorithms for dynamic speed scaling

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

46 Scopus citations

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.

Original languageEnglish
Title of host publication28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011
Pages1-11
Number of pages11
DOIs
StatePublished - 2011
Externally publishedYes
Event28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 - Dortmund, Germany
Duration: 10 Mar 201112 Mar 2011

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume9
ISSN (Print)1868-8969

Conference

Conference28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011
Country/TerritoryGermany
CityDortmund
Period10/03/1112/03/11

Keywords

  • Competitive analysis
  • Energy-efficiency
  • Flow time
  • Job deadline
  • Offline algorithm
  • Online algorithm
  • Response time
  • Scheduling
  • Variable-speed processor

Fingerprint

Dive into the research topics of 'Algorithms for dynamic speed scaling'. Together they form a unique fingerprint.

Cite this