Energy-aware algorithms for task graph scheduling, replica placement and checkpoint strategies
Book chapter, 2015

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.

Author

G. Aupy

École Normale Supérieure de Lyon

A. Benoit

Institut Universitaire de France

École Normale Supérieure de Lyon

Paul Renaud Goud

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Y. Robert

University of Tennessee

Institut Universitaire de France

École Normale Supérieure de Lyon

Handbook on Data Centers

37-80
9781493920921 (ISBN)

Subject Categories

Computer Engineering

DOI

10.1007/978-1-4939-2092-1_2

ISBN

9781493920921

More information

Created

10/7/2017