Temperature aware online scheduling with a low cooling factor

  • Authors:
  • Martin Birks;Stanley P Y. Fung

  • Affiliations:
  • Department of Computer Science, University of Leicester, Leicester, United Kingdom;Department of Computer Science, University of Leicester, Leicester, United Kingdom

  • Venue:
  • TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of scheduling jobs in a processor with temperature constraints In our model, unit jobs arrive over time, each with a deadline and a heat contribution The objective is to maximize the total number of completed jobs while keeping the system within a given temperature threshold Our main result is the analysis of a large class of ‘reasonable' algorithms We analyse the competitive ratio of these algorithms as a function of the cooling factor of the system, and show that they are optimal by giving a matching lower bound We also give some results concerning the multiple machines case.