On multiprocessor temperature-aware scheduling problems

Evripidis Bampis (1) , Dimitrios Letsios (2, 1) , Giorgio Lucarelli (2, 1) , Evangelos Markakis (3) , Ioannis Z. Milis (3)

1 RO - Recherche Opérationnelle
2 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
3 DI NKUA - Department of Informatics and Telecomunications [Kapodistrian Univ]

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 (4/3-ε)-approximation algorithm for the problem of minimizing the makespan for any ε > 0, unless P = NP.

Keywords: Makespan; Maximum temperature; Optimization criteria; Polynomial time approximation algorithms; Polynomial-time algorithms; Scheduling problem; Weighted averages

Domains: Operations Research [math.OC]

Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Z. Milis. On multiprocessor temperature-aware scheduling problems. 6th International Frontiers of Algorithmics Workshop (FAW 2012) and 8th International Conference on Algorithmic Aspects of Information and Management (AAIM 2012), May 2012, Beijing, China. pp.149--160, ⟨10.1007/978-3-642-29700-7_14⟩. ⟨hal-00820172⟩