On multiprocessor temperature-aware scheduling problems

  • Authors:

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

  • Affiliations:

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

  • Venue:
  • FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study temperature-aware scheduling problems under the model introduced by Chrobak et al. in [9], where unit-length jobs of given heat contributions 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 $(\frac{4}{3}-\epsilon)$ -approximation algorithm for the problem of minimizing the makespan for any ε 0, unless ${\cal P}={\cal NP}$ .