Sciweavers

Share
MFCS
2005
Springer

An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

12 years 3 months ago
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for n jobs in O(dn log n) time. Previous approaches solve this problem by first computing the optimal continuous solution in O(n3) time and then adjusting the speed to discrete levels. In our approach, the optimal discrete solution is characterized and computed directly from the inputs. We also show that O(n log n) time is required, hence the algorithm is optimal for fixed d. Key words. scheduling, energy efficiency, variable voltage processor, discrete optimization AMS subject classifications. 90B35, 90B80
Minming Li, Frances F. Yao
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where MFCS
Authors Minming Li, Frances F. Yao
Comments (0)
books