Speed Scaling to Manage Temperature

  • Leon Atkins
  • Guillaume Aupy
  • Daniel Cole
  • Kirk Pruhs
Conference paper

DOI: 10.1007/978-3-642-19754-3_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6595)
Cite this paper as:
Atkins L., Aupy G., Cole D., Pruhs K. (2011) Speed Scaling to Manage Temperature. In: Marchetti-Spaccamela A., Segal M. (eds) Theory and Practice of Algorithms in (Computer) Systems. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg

Abstract

We consider the speed scaling problem where the quality of service objective is deadline feasibility and the power objective is temperature. In the case of batched jobs, we give a simple algorithm to compute the optimal schedule. For general instances, we give a new online algorithm, and obtain an upper bound on the competitive ratio of this algorithm that is an order of magnitude better than the best previously known bound upper bound on the competitive ratio for this problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Leon Atkins
    • 1
  • Guillaume Aupy
    • 2
  • Daniel Cole
    • 3
  • Kirk Pruhs
    • 4
  1. 1.Department of Computer ScienceUniversity of BristolUK
  2. 2.Computer Science DepartmentENS LyonFrance
  3. 3.Computer Science DepartmentUniversity of PittsburghUSA
  4. 4.Computer Science DepartmentUniversity of PittsburghUSA

Personalised recommendations