Philippe Baptiste
Abstract
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining a satisfactory level of performance. One common method for saving energy is to simply suspend the system during idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time is long enough to compensate for this additional energy expenditure. In the specific problem studied in the article, we have a set of jobs with release times and deadlines that need to be executed on a single processor. Preemptions are allowed. The processor requires energy L to be woken up and, when it is on, it uses one unit of energy per one unit of time. It has been an open problem whether a schedule minimizing the overall energy consumption can be computed in polynomial time. We solve this problem in positive, by providing an O(n5)-time algorithm. In addition we provide an O(n4)-time algorithm for computing the minimum energy schedule when all jobs have unit length.
- Augustine, J., Irani, S., and Swamy, C. 2004. Optimal power-down strategies. In Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS). 530--539. Google Scholar
Digital Library
- Baptiste, P. 2006. Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 364--367. Google ScholarDigital Library
- Brucker, P. 2004. Scheduling Algorithms 4th Ed., Springer. Google ScholarDigital Library
- Chrétienne, P. 2008. On single-machine scheduling without intermediate delays. Discr. Appl. Math. 156, 13, 2543--2550. Google ScholarDigital Library
- Demaine, E. D., Ghodsi, M., Hajiaghayi, M. T., Sayedi-Roshkhar, A. S., and Zadimoghaddam, M. 2007. Scheduling to minimize gaps and power consumption. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 46--54. Google ScholarDigital Library
- Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co. Google ScholarDigital Library
- Irani, S. and Pruhs, K. R. 2005. Algorithmic problems in power management. SIGACT News 36, 2, 63--76. Google ScholarDigital Library
- Irani, S., Shukla, S., and Gupta, R. 2002. Competitive analysis of dynamic power management strategies for systems with multiple power savings states. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE). 117. Google ScholarDigital Library
- Irani, S., Shukla, S., and Gupta, R. 2003a. Algorithms for power savings. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 37--46. Google ScholarDigital Library
- Irani, S., Shukla, S., and Gupta, R. 2003b. Online strategies for dynamic power management in systems with multiple power-saving states. Trans. Embed. Comput. Syst. 2, 3, 325--346. Google ScholarDigital Library
- Li, M. and Yao, F. F. 2005. An efficient algorithm for computing optimal discrete voltage schedules. SIAM J. Comput. 35, 3, 658--671. Google ScholarDigital Library
Index Terms
- Polynomial-time algorithms for minimum energy scheduling
Recommendations
Polynomial time algorithms for minimum energy scheduling
ESA'07: Proceedings of the 15th annual European conference on AlgorithmsThe aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy ...
Energy-Aware Scheduling of MapReduce Jobs for Big Data Applications
The majority of large-scale data intensive applications executed by data centers are based on MapReduce or its open-source implementation, Hadoop. Such applications are executed on large clusters requiring large amounts of energy, making the energy costs ...
Comments