Chapter

Theory and Practice of Algorithms in (Computer) Systems

Volume 6595 of the series Lecture Notes in Computer Science pp 9-20

Speed Scaling to Manage Temperature

  • Leon AtkinsAffiliated withLancaster UniversityDepartment of Computer Science, University of Bristol
  • , Guillaume AupyAffiliated withLancaster UniversityComputer Science Department, ENS Lyon
  • , Daniel ColeAffiliated withCarnegie Mellon UniversityComputer Science Department, University of Pittsburgh
  • , Kirk PruhsAffiliated withCarnegie Mellon UniversityComputer Science Department, University of Pittsburgh

* Final gross prices may vary according to local VAT.

Get Access

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.