Skip to Main content Skip to Navigation
Book sections

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.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.inria.fr/hal-01357849
Contributor : Equipe Roma <>
Submitted on : Tuesday, August 30, 2016 - 3:14:34 PM
Last modification on : Thursday, June 18, 2020 - 10:18:03 AM

File

chapter.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

791

Files downloads

700