Optimal voltage allocation techniques for dynamically variable voltage processors
Proceedings of the 40th annual Design Automation Conference
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)
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
SIAM Journal on Computing
Speed scaling to manage energy and temperature
Journal of the ACM (JACM)
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Speed Scaling with a Solar Cell
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
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
The bell is ringing in speed-scaled multiprocessor scheduling
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Speed scaling with a solar cell
Theoretical Computer Science
Communications of the ACM
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
Speed Scaling for Weighted Flow Time
SIAM Journal on Computing
Speed scaling to manage temperature
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
On multi-processor speed scaling with migration: extended abstract
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Speed scaling problems with memory/cache consideration
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
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 |
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dual-objective scheduling problems, where the operating system both wants to conserve energy and optimize some Quality of Service (QoS) measure of the resulting schedule. Yao, Demers, and Shenker [8] considered the problem where the QoS constraint is deadline feasibility and the objective is to minimize the energy used. They proposed an online speed scaling algorithm Average Rate (AVR) that runs each job at a constant speed between its release and its deadline. They showed that the competitive ratio of AVR is at most (2α)α/2 if a processor running at speed s uses power sα. We show the competitive ratio of AVR is at least ((2-δ)α)α/2, where δ is a function of α that approaches zero as α approaches infinity. This shows that the competitive analysis of AVR by Yao, Demers, and Shenker is essentially tight, at least for large α. We also give an alternative proof that the competitive ratio of AVR is at most (2α)α/2 using a potential function argument. We believe that this analysis is significantly simpler and more elementary than the original analysis of AVR in [8].