On multiprocessor temperature-aware scheduling problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2013

On multiprocessor temperature-aware scheduling problems

Résumé

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}.

Dates et versions

hal-00801394 , version 1 (15-03-2013)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More