On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
Real-time dynamic voltage scaling for low-power embedded operating systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On energy-optimal voltage scheduling for fixed-priority hard real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Optimal voltage allocation techniques for dynamically variable voltage processors
ACM Transactions on Embedded Computing Systems (TECS)
Algorithmic problems in power management
ACM SIGACT News
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
SIAM Journal on Computing
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in 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
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Speed scaling of tasks with precedence constraints
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Min-energy voltage allocation for tree-structured tasks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Speed scaling to manage temperature
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Competitive non-migratory scheduling for flow time and energy
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Speed Scaling with a Solar Cell
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The bell is ringing in speed-scaled multiprocessor scheduling
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Energy-Aware Scheduling of Flow Applications on Master-Worker Platforms
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Speed scaling with a solar cell
Theoretical Computer Science
Energy optimal schedules for jobs with multiple active intervals
Theoretical Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Communications of the ACM
Online deadline scheduling with bounded energy efficiency
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Energy efficient deadline scheduling in two processor systems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Energy-efficient windows scheduling
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Routing for energy minimization in the speed scaling model
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
How to schedule when you have to buy your energy
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Min-energy scheduling for aligned jobs in accelerate model
Theoretical Computer Science
Tradeoff between energy and throughput for online deadline scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Speed Scaling for Weighted Flow Time
SIAM Journal on Computing
On multi-processor speed scaling with migration: extended abstract
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science
Improved multi-processor scheduling for flow time and energy
Journal of Scheduling
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
Energy efficient scheduling of parallel tasks on multiprocessor computers
The Journal of Supercomputing
The Journal of Supercomputing
Energy-Efficient network routing with discrete cost functions
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Slow down and sleep for profit in online deadline scheduling
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Rate-adaptive weighted fair queueing for energy-aware scheduling
Information Processing Letters
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
Theory of Computing Systems
| Hi-index | 0.02 |
This paper extends the study of online algorithms for energy-efficient deadline scheduling to the overloaded setting. Specifically, we consider a processor that can vary its speed between 0 and a maximum speed T to minimize its energy usage (of which the rate is roughly a cubic function of the speed). As the speed is upper bounded, the system may be overloaded with jobs and no scheduling algorithms can meet the deadlines of all jobs. An optimal schedule is expected to maximize the throughput, and furthermore, its energy usage should be the smallest among all schedules that achieve the maximum throughput. In designing a scheduling algorithm, one has to face the dilemma of selecting more jobs and being conservative in energy usage. Even if we ignore energy usage, the best possible online algorithm is 4-competitive on throughput [12]. On the other hand, existing work on energy-efficient scheduling focuses on minimizing the energy to complete all jobs on a processor with unbounded speed, giving several O(1)-competitive algorithms with respect to the energy usage [2, 20]. This paper presents the first online algorithm for the more realistic setting where processor speed is bounded and the system may be overloaded; the algorithm is O(1)-competitive on both throughput and energy usage. If the maximum speed of the online scheduler is relaxed slightly to (1 + ε)T for some ε 0, we can improve the competitive ratio on throughput to arbitrarily close to one, while maintaining O(1)-competitive on energy usage.