Speed Scaling to Manage Temperature.

Abstract : We consider the speed scaling problem where the quality of service objective is deadline feasibility and the power objective is temperature. In the case of batched jobs, we give a simple algorithm to compute the optimal schedule. For general instances, we give a new online algorithm, and obtain an upper bound on the competitive ratio of this algorithm that is an order of magnitude better than the best previously known bound upper bound on the competitive ratio for this problem.
Type de document :
Communication dans un congrès
TAPAS - 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, 2011, Rome, Italy. pp.9-20, 2011, 〈10.1007/978-3-642-19754-3_4〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00786200
Contributeur : Equipe Roma <>
Soumis le : mardi 3 septembre 2013 - 11:44:13
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : mercredi 4 décembre 2013 - 02:45:12

Fichier

tapas11.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Leon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs. Speed Scaling to Manage Temperature.. TAPAS - 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, 2011, Rome, Italy. pp.9-20, 2011, 〈10.1007/978-3-642-19754-3_4〉. 〈hal-00786200〉

Partager

Métriques

Consultations de la notice

193

Téléchargements de fichiers

127