CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

G. Aupy ; A. Benoit ; Paul Renaud-Goud (Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) ) ; Y. Robert
Handbook on Data Centers p. 37-80. (2015)
[Kapitel]

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.



Denna post skapades 2015-11-16.
CPL Pubid: 225771

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Nätverk och system (Chalmers)

Ämnesområden

Datorteknik

Chalmers infrastruktur