Energy-Aware Algorithms for Task Graph Scheduling, Replica Placement and Checkpoint Strategies - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Chapitre D'ouvrage Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
chapter.pdf (516.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01357849 , version 1 (30-08-2016)

Identifiants

Citer

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⟩
94 Consultations
188 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More