Competitive randomized algorithms for non-uniform problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A survey of design techniques for system-level dynamic power management
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on low-power electronics and design
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Online strategies for dynamic power management in systems with multiple power-saving states
ACM Transactions on Embedded Computing Systems (TECS)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic problems in power management
ACM SIGACT News
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
Competitive non-migratory scheduling for flow time and energy
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Scheduling for Speed Bounded Processors
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Speed scaling with an arbitrary power function
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Sleep management on multiple machines for energy and flow time
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Competitive online algorithms for multiple-machine power management and weighted flow time
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Adaptive workload driven dynamic power management for high performance computing clusters
Computers and Electrical Engineering
| Hi-index | 0.00 |
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called IdleLonger, which works online for a processor with one or multiple levels of sleep states. The design of IdleLonger is interesting; among others, it may force the processor to idle or even sleep even though new jobs have already arrived. IdleLonger works in both clairvoyant and non-clairvoyant settings. We show how to adapt two existing speed scaling algorithms AJC [15] (clairvoyant) and LAPS [9] (non-clairvoyant) to the new model. The adapted algorithms, when coupled with IdleLonger, are shown to be O(1)-competitive clairvoyant and non-clairvoyant algorithms for minimizing flow plus energy on a processor that allows sleep management and speed scaling. The above results are based on the traditional model with no limit on processor speed. If the processor has a maximum speed, the problem becomes more difficult as the processor, once overslept, cannot rely on unlimited extra speed to catch up the delay. Nevertheless, we are able to enhance IdleLonger and AJC so that they remain O (1)-competitive for flow plus energy under the bounded speed model. Non-clairvoyant scheduling in the bounded speed model is left as an open problem.