Skip to Main content Skip to Navigation
New interface
Conference papers

Brief Announcement: 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 
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. We study the complexity of the problem for different models: continuous speeds, discrete modes, distributed either arbitrarily or regularly, and VDD-hopping.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, September 3, 2013 - 11:56:20 AM
Last modification on : Tuesday, October 25, 2022 - 4:24:44 PM
Long-term archiving on: : Thursday, April 6, 2017 - 2:45:41 PM


Files produced by the author(s)




Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert. Brief Announcement: Reclaiming the Energy of a Schedule, Models and Algorithms. SPAA '11 - 23rd ACM Symposium on Parallelism in Algorithms and Architectures, Jun 2011, San Jose, United States. pp.135-136, ⟨10.1145/1989493.1989512⟩. ⟨hal-00857268⟩



Record views


Files downloads