Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Online strategies for dynamic power management in systems with multiple power-saving states
ACM Transactions on Embedded Computing Systems (TECS)
Proceedings of the conference on Design, automation and test in Europe
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic problems in power management
ACM SIGACT News
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Communications of the ACM
SIGACT news online algorithms column 17
ACM SIGACT News
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Race to idle: new algorithms for speed scaling with a sleep state
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Optimal DPM and DVFS for frame-based real-time systems
ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
Slow down and sleep for profit in online deadline scheduling
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
| Hi-index | 0.02 |
The 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 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 paper, 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 the energy at a rate of R units per 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.