Brief Announcement: Reclaiming the Energy of a Schedule, Models and Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Brief Announcement: 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. 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.
Fichier principal
Vignette du fichier
spaa48a-benoit.pdf (213.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00857268 , version 1 (03-09-2013)

Identifiers

Cite

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⟩
118 View
180 Download

Altmetric

Share

Gmail Facebook X LinkedIn More