Skip to main content
Article thumbnail
Location of Repository

Speed Scaling to Manage Temperature

By Leon Atkins, Guillaume Aupy, Daniel Cole and Kirk Pruhs

Abstract

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.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.5860
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.bris.ac.uk/Resea... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.