On multiprocessor temperature-aware scheduling problems

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 {Mathematical expression} for the problem of minimizing the makespan for any {Mathematical expression}, unless {Mathematical expression}.
Document type :
Journal articles
Liste complète des métadonnées

Contributor : Frédéric Davesne <>
Submitted on : Friday, March 15, 2013 - 5:17:41 PM
Last modification on : Thursday, March 21, 2019 - 2:54:21 PM

Links full text



Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis. On multiprocessor temperature-aware scheduling problems. Journal of Scheduling, Springer Verlag, 2013, 16 (5), pp.529--538. ⟨10.1007/s10951-013-0319-z⟩. ⟨hal-00801394⟩



Record views