License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2011.1
URN: urn:nbn:de:0030-drops-29954
URL: http://drops.dagstuhl.de/opus/volltexte/2011/2995/

Albers, Susanne

Algorithms for Dynamic Speed Scaling

pdf-format:
Dokument 1.pdf (531 KB)


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.

BibTeX - Entry

@InProceedings{albers:LIPIcs:2011:2995,
  author =	{Susanne Albers},
  title =	{{Algorithms for Dynamic Speed Scaling}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
  pages =	{1--11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Thomas Schwentick and Christoph D{\"u}rr},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/2995},
  URN =		{urn:nbn:de:0030-drops-29954},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2011.1},
  annote =	{Keywords: competitive analysis, energy-efficiency, flow time, job deadline, offline algorithm, online algorithm, response time, scheduling, variable-speed proce}
}

Keywords: competitive analysis, energy-efficiency, flow time, job deadline, offline algorithm, online algorithm, response time, scheduling, variable-speed proce
Seminar: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Issue date: 2011
Date of publication: 11.03.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI