Energy-Aware Algorithms for Task Graph Scheduling, Replica Placement and Checkpoint Strategies

Abstract : The energy consumption of computational platforms has recently become a critical problem, both for economic and environmental reasons. To reduce energy consumption, processors can run at different speeds. Faster speeds allow for a faster execution, but they also lead to a much higher (superlinear) power consumption. Energy-aware scheduling aims at minimizing the energy consumed during the execution of the target application, both for computations and for communications. The price to pay for a lower energy consumption usually is a much larger execution time, so the energy-aware approach makes better sense when coupled with some prescribed performance bound. In other words, we have a bi-criteria optimization problem, with one objective being energy minimization, and the other being performance-related.
Type de document :
Chapitre d'ouvrage
Khan, U. Samee and Zomaya, Y. Albert. Handbook on Data Centers, Springer New York, pp.37--80, 2015, 978-1-4939-2092-1. 〈10.1007/978-1-4939-2092-1_2〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01357849
Contributeur : Equipe Roma <>
Soumis le : mardi 30 août 2016 - 15:14:34
Dernière modification le : mardi 16 janvier 2018 - 15:36:32

Fichier

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

Identifiants

Collections

Citation

Guillaume Aupy, Anne Benoit, Paul Renaud-Goud, Yves Robert. Energy-Aware Algorithms for Task Graph Scheduling, Replica Placement and Checkpoint Strategies. Khan, U. Samee and Zomaya, Y. Albert. Handbook on Data Centers, Springer New York, pp.37--80, 2015, 978-1-4939-2092-1. 〈10.1007/978-1-4939-2092-1_2〉. 〈hal-01357849〉

Partager

Métriques

Consultations de la notice

650

Téléchargements de fichiers

72