On Multiprocessor Temperature-Aware Scheduling Problems - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2011

On Multiprocessor Temperature-Aware Scheduling Problems

Résumé

We study temperature-aware scheduling problems under the model introduced by Chrobak et al. in [6]. We consider a set of parallel identi- cal processors and three optimization criteria: makespan, maximum tem- perature 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 poly- nomial 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.
Fichier principal
Vignette du fichier
cahier_310.pdf (210.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00875550 , version 1 (22-10-2013)

Identifiants

  • HAL Id : hal-00875550 , version 1

Citer

Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis. On Multiprocessor Temperature-Aware Scheduling Problems. 2011. ⟨hal-00875550⟩
135 Consultations
208 Téléchargements

Partager

Gmail Facebook X LinkedIn More