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(n 3) 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yao, F., Demers, A., Shenker, S.: A Scheduling Model for Reduced CPU Energy. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 374–382 (1995)
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)
Kwon, W., Kim, T.: Optimal Voltage Allocation Techniques for Dynamically Variable Voltage Processors. In: 40th Design Automation Conference (2003)
Mochocki, B., Hu, X.S., Quan, G.: A Realistic Variable Voltage Scheduling Model for Real-Time Applications. In: IEEE/ACM International Conference on Computer- Aided Design (2002)
Jejurikar, R., Gupta, R.K.: Dynamic Voltage Scaling for Systemwide Energy Minimization in Real-Time Embedded Systems. In: International Symposium on Low Power Electronics and Design (2004)
Yun, H.S., Kim, J.: On Energy-Optimal Voltage Scheduling for Fixed-Priority Hard Real-Time Systems. ACM Transactions on Embedded Computing Systems 2(3), 393–430 (2003)
Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic Speed Scaling to Manage Energy and Temperature. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 520–529 (2004)
Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time Bounds for Selection. Journal of Computer and System Sciences 7, 488–491 (1973)
Augustine, J., Irani, S., Swamy, C.: Optimal Power-Down Strategies. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 530–539 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, M., Liu, B.J., Yao, F.F. (2005). Min-Energy Voltage Allocation for Tree-Structured Tasks. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_30
Download citation
DOI: https://doi.org/10.1007/11533719_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)