Brief Announcement: Reclaiming the Energy of a Schedule, Models and Algorithms

Abstract : We consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the execution time. While it is not possible to change the allocation of a task, it is possible to change its speed. We study the complexity of the problem for different models: continuous speeds, discrete modes, distributed either arbitrarily or regularly, and VDD-hopping.
Type de document :
Communication dans un congrès
SPAA '11 - 23rd ACM Symposium on Parallelism in Algorithms and Architectures, Jun 2011, San Jose, United States. ACM, pp.135-136, 2011, 〈10.1145/1989493.1989512〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00857268
Contributeur : Equipe Roma <>
Soumis le : mardi 3 septembre 2013 - 11:56:20
Dernière modification le : vendredi 20 avril 2018 - 15:44:27
Document(s) archivé(s) le : jeudi 6 avril 2017 - 14:45:41

Fichier

spaa48a-benoit.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert. Brief Announcement: Reclaiming the Energy of a Schedule, Models and Algorithms. SPAA '11 - 23rd ACM Symposium on Parallelism in Algorithms and Architectures, Jun 2011, San Jose, United States. ACM, pp.135-136, 2011, 〈10.1145/1989493.1989512〉. 〈hal-00857268〉

Partager

Métriques

Consultations de la notice

225

Téléchargements de fichiers

145