Reclaiming the energy of a schedule: models and algorithms

Guillaume Aupy 1, 2 Anne Benoit 1, 2, * Fanny Dufossé 1, 2 Yves Robert 1, 2
* Corresponding author
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 processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the execution time. While it is not possible to change the allocation of a task, it is possible to change its speed. Rather than using a local approach such as backfilling, we consider the problem as a whole and study the impact of several speed variation models on its complexity. For continuous speeds, we give a closed-form formula for trees and series-parallel graphs, and we cast the problem into a geometric programming problem for general directed acyclic graphs. We show that the classical dynamic voltage and frequency scaling (DVFS) model with discrete modes leads to a NP-complete problem, even if the modes are regularly distributed (an important particular case in practice, which we analyze as the incremental model). On the contrary, the VDD-hopping model leads to a polynomial solution. Finally, we provide an approximation algorithm for the incremental model, which we extend for the general DVFS model.
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/inria-00584944
Contributor : Anne Benoit <>
Submitted on : Monday, April 11, 2011 - 1:55:07 PM
Last modification on : Thursday, May 16, 2019 - 3:40:34 PM
Long-term archiving on : Thursday, November 8, 2012 - 4:10:18 PM

File

RR-7598.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00584944, version 1

Collections

Citation

Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert. Reclaiming the energy of a schedule: models and algorithms. [Research Report] RR-7598, INRIA. 2011, pp.21. ⟨inria-00584944⟩

Share

Metrics

Record views

406

Files downloads

187