Skip to Main content Skip to Navigation
Journal articles

Reclaiming the energy of a schedule: models and algorithms

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. Although 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 an 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 that allows to switch between different supply voltages (VDD) while executing a task leads to a polynomial solution. Finally, we provide an approximation algorithm for the incremental model, which we extend for the general DVFS model.
Document type :
Journal articles
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, September 3, 2013 - 11:29:07 AM
Last modification on : Thursday, January 20, 2022 - 4:13:52 PM
Long-term archiving on: : Friday, March 31, 2017 - 6:16:57 PM


Files produced by the author(s)




Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert. Reclaiming the energy of a schedule: models and algorithms. Concurrency and Computation: Practice and Experience, Wiley, 2013, 25, pp.1505-1523. ⟨10.1002/cpe.2889⟩. ⟨hal-00763388⟩



Les métriques sont temporairement indisponibles