Skip to Main content Skip to Navigation

Energy-aware scheduling under reliability and makespan constraints

Guillaume Aupy 1, 2 Anne Benoit 2, 1 yves Robert 2, 1 
Abstract : We consider a task graph mapped on a set of homogeneous processors. We aim at minimizing the energy consumption while enforcing two constraints: a prescribed bound on the execution time (or makespan), and a reliability threshold. Dynamic voltage and frequency scaling (DVFS) is an approach frequently used to reduce the energy consumption of a schedule, but slowing down the execution of a task to save energy is decreasing the reliability of the execution. In this work, to improve the reliability of a schedule while reducing the energy consumption, we allow for the re-execution of some tasks. We assess the complexity of the tri-criteria scheduling problem (makespan, reliability, energy) of deciding which task to re-execute, and at which speed each execution of a task should be done, with two different speed models: either processors can have arbitrary speeds (continuous model), or a processor can run at a finite number of different speeds and change its speed during a computation (VDD-hopping model). We propose several novel tri-criteria scheduling heuristics under the continuous speed model, and we evaluate them through a set of simulations. The two best heuristics turn out to be very efficient and complementary.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Anne Benoit Connect in order to contact the contributor
Submitted on : Friday, February 3, 2012 - 10:09:36 AM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Wednesday, December 14, 2016 - 4:03:50 AM


Files produced by the author(s)


  • HAL Id : inria-00630721, version 3



Guillaume Aupy, Anne Benoit, yves Robert. Energy-aware scheduling under reliability and makespan constraints. [Research Report] RR-7757, INRIA. 2012, pp.25. ⟨inria-00630721v3⟩



Record views


Files downloads