Skip to Main content Skip to Navigation

Energy-aware scheduling under reliability and makespan constraints

Guillaume Aupy 1, 2 Anne Benoit 1, 2 Yves Robert 1, 2
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We consider a task graph to be executed 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 a model frequently used to reduce the energy consumption of a schedule, but it has negative effect on its reliability. 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) with two different speed models: either processors can have arbitrary speeds (continuous speeds), or a processor can run at a finite number of different speeds, and it can change its speed during a computation. We propose several novel tri-criteria scheduling heuristics under the continuous speed model, and we evaluate them through a set of simulations. Our two best heuristics turn out to be very efficient and complementary.
Complete list of metadata
Contributor : Anne Benoit <>
Submitted on : Monday, October 10, 2011 - 5:27:11 PM
Last modification on : Monday, November 16, 2020 - 9:58:10 AM
Long-term archiving on: : Tuesday, November 13, 2012 - 3:36:09 PM


Files produced by the author(s)


  • HAL Id : inria-00630721, version 1



Guillaume Aupy, Anne Benoit, Yves Robert. Energy-aware scheduling under reliability and makespan constraints. [Research Report] RR-7757, 2011, pp.24. ⟨inria-00630721v1⟩



Record views


Files downloads