On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
Real-time dynamic voltage scaling for low-power embedded operating systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
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
Speed scaling to manage energy and temperature
Journal of the ACM (JACM)
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Policies for dynamic clock scheduling
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Scheduling for reduced CPU energy
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
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)
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
The bell is ringing in speed-scaled multiprocessor scheduling
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Optimizing throughput and energy in online deadline scheduling
ACM Transactions on Algorithms (TALG)
Improved multi-processor scheduling for flow time and energy
Journal of Scheduling
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
Race to idle: new algorithms for speed scaling with a sleep state
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Energy-efficient deadline scheduling for heterogeneous systems
Journal of Parallel and Distributed Computing
Slow down and sleep for profit in online deadline scheduling
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Race to idle: New algorithms for speed scaling with a sleep state
ACM Transactions on Algorithms (TALG)
| Hi-index | 5.23 |
In this paper we consider online deadline scheduling on a processor that can manage its energy usage by scaling the speed dynamically or entering a sleep state. A new online scheduling algorithm called SOA is presented. Assuming speed can be scaled arbitrarily high (the infinite speed model), SOA can complete all jobs with reduced energy usage, improving the competitive ratio for energy from 2^2^@a^-^2@a^@a+2^@a^-^1+2 (Irani et al. (2007) [17]) to @a^@a+2, where @a is the constant involved in the speed-to-power function, commonly believed to be 2 or 3. More importantly, SOA is the first algorithm that works well even if the processor has a fixed maximum speed and the system is overloaded. In this case, SOA is 4-competitive for throughput and (@a^@a+@a^24^@a+2)-competitive for energy. Note that the throughput ratio cannot be better than 4 even if energy is not a concern.