Brief announcement: reclaiming the energy of a schedule, models and algorithms

Authors:
Guilaume Aupy;Anne Benoit;Fanny Dufossé;Yves Robert
Affiliations:
LIP, ENS Lyon, Lyon, France;LIP, ENS Lyon, Lyon, France;LIP, ENS Lyon, Lyon, France;LIP, ENS Lyon, Lyon, France
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 6
Cited 0

Voltage scheduling problem for dynamically variable voltage processors

ISLPED '98 Proceedings of the 1998 international symposium on Low power electronics and design
JouleTrack: a web based tool for software energy profiling

Proceedings of the 38th annual Design Automation Conference
Software Energy Reduction Techniques for Variable-Voltage Processors

IEEE Design & Test
Convex Optimization

Convex Optimization
Speed scaling to manage energy and temperature

Journal of the ACM (JACM)
A Power Supply Selector for Energy- and Area-Efficient Local Dynamic Voltage Scaling

PATMOS '07 Proceedings of the 17th international workshop on Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation

Quantified Score

Hi-index	0.00

Visualization

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.