Abstract
We study job scheduling on processors capable of running at variable voltage/speed to minimize energy consumption. Each job in a problem instance is specified by its arrival time and deadline, together with required number of CPU cycles. It is known that the minimum energy schedule for n jobs can be computed in O(n3) time, assuming a convex energy function. We investigate more efficient algorithms for computing the optimal schedule when the job sets have certain special structures. When the time intervals are structured as trees, the minimum energy schedule is shown to have a succinct characterization and is computable in time O(P) where P is the tree’s total path length. We also study an on-line average-rate heuristics AVR and prove that its energy consumption achieves a small constant competitive ratio for nested job sets and for job sets with limited overlap. Some simulation results are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Augustine J, Irani S, Swamy C (2004) Optimal power-down strategies. In: Proc. of the 45th Annual Symposium on Foundations of Computer Science, pp. 530–539
Bansal N, Kimbrel T, Pruhs K (2004) Dynamic Speed Scaling to Manage Energy and Temperature. In: Proc. of the 45th Annual Symposium on Foundations of Computer Science, pp. 520–529 .
Blum M, Floyd R, Pratt V, Rivest R, Tarjan R (1973) Time Bounds for Selection. J Comp and Sys Sci 7:488–461
Intel Corporation, Wireless Intel SpeedStep Power Manager—Optimizing Power Consumption for the Intel PXA27x processor family. Wireless Intel SpeedStep(R) Power Manager White Paper, 2004
Jejurikar R, Gupta RK (2004) Dynamic Voltage Scaling for Systemwide Energy Minimization in Real-Time Embedded Systems. International Symposium on Low Power Electronics and Design
Kwon W, Kim T (2003) Optimal Voltage Allocation Techniques for Dynamically Variable Voltage Processors. 40th Design Automation Conference
Mochocki B, Hu XS, Quan G (2002) A Realistic Variable Voltage Scheduling Model for Real-Time Applications. IEEE/ACM International Conference on Computer-Aided Design
Yao F, Demers A, Shenker S (1995) A Scheduling Model for Reduced CPU Energy. In: Proc. of the 36th Annual Symposium on Foundations of Computer Science, 374–382
Yun HS, Kim J (2003) On Energy-Optimal Voltage Scheduling for Fixed-Priority Hard Real-Time Systems. ACM Transactions on Embedded Computing Systems 2(3):393–430
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported in part by Research Grants Council of Hong Kong under grant No. CityU 1165/04E, National Natural Science Foundation of China under Grant No. 60135010, 60321002 and the Chinese National Key Foundation Research & Development Plan (2004CB318108).
Rights and permissions
About this article
Cite this article
Li, M., Liu, B.J. & Yao, F.F. Min-energy voltage allocation for tree-structured tasks. J Comb Optim 11, 305–319 (2006). https://doi.org/10.1007/s10878-006-7910-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-7910-6