Current dynamic voltage scaling techniques allow the speed of processors to be set dynamically in order to save energy consumption, which is a major concern in microprocessor design. A theoretical model for min-energy job scheduling was first proposed a decade ago, and it was shown that for any convex energy function, the min-energy schedule for a set of n jobs has a unique characterization and is computable in O(n 3 ) time. This algorithm has remained as the most efficient known despite many investigations of this model. In this paper we give a new algorithm with running time O(n 2 log n) for finding the min-energy schedule. In contrast to the previous algorithm which outputs optimal speed levels from high to low iteratively, the new algorithm is based on finding successive approximations to the optimal schedule. At the core of the approximation is an efficient partitioning of the job set into high and low speed subsets by any speed threshold, without computing the exact speed function.
Later on, the running time is improved to O(n 2 log n) by Li et al. REF .
Discrete and Continuous Min-Energy Schedules for Variable Voltage Processors ∗
Proceedings of the National Academy of Sciences of the United States of America
Proceedings of the National Academy of Sciences of the United States of America
Computer Science Medicine