On multiprocessor temperature-aware scheduling problems

  • Authors:

  • Evripidis Bampis;Dimitrios Letsios;Giorgio Lucarelli;Evangelos Markakis;Ioannis Milis

  • Affiliations:

  • LIP6, Université Pierre et Marie Curie, Paris, France;LIP6, Université Pierre et Marie Curie, Paris, France and IBISC, Université d' Évry, Paris, France;LIP6, Université Pierre et Marie Curie, Paris, France and IBISC, Université d' Évry, Paris, France;Department of Informatics, Athens University of Economics ansd Business, Athens, Greece;Department of Informatics, Athens University of Economics ansd Business, Athens, Greece

  • Venue:
  • Journal of Scheduling
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study temperature-aware scheduling problems under the model introduced in [Chrobak et al. AAIM 2008], where unit-length jobs of given heat contributions and common release dates are to be scheduled on a set of parallel identical processors. We consider three optimization criteria: makespan, maximum temperature and (weighted) average temperature. On the positive side, we present polynomial time approximation algorithms for the minimization of the makespan and the maximum temperature, as well as, optimal polynomial time algorithms for minimizing the average temperature and the weighted average temperature. On the negative side, we prove that there is no approximation algorithm of absolute ratio $$\frac{4}{3}-\epsilon $$ for the problem of minimizing the makespan for any $$\epsilon 0$$, unless $$\mathcal{P}=\mathcal{NP}$$.