A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Algorithmic problems in power management
ACM SIGACT News
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Speed scaling to manage energy and temperature
Journal of the ACM (JACM)
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of dynamic voltage/frequency scaling in chip-multiprocessors
ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
Power Aware Management of Packet Switches
HOTI '07 Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects
Approximation algorithm for the temperature-aware scheduling problem
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A case for adapting channel width in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Computer Architecture Techniques for Power-Efficiency
Computer Architecture Techniques for Power-Efficiency
Speed scaling with an arbitrary power function
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Analysis of energy reduction on dynamic voltage scaling-enabled systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Scalably scheduling power-heterogeneous processors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Non-clairvoyant speed scaling for weighted flow time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Tradeoff between energy and throughput for online deadline scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Energy-efficient due date scheduling
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
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
Scheduling for weighted flow time and energy with rejection penalty
Theoretical Computer Science
Speed Scaling with an Arbitrary Power Function
ACM Transactions on Algorithms (TALG)
Race to idle: New algorithms for speed scaling with a sleep state
ACM Transactions on Algorithms (TALG)
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
Theory of Computing Systems
| Hi-index | 0.00 |
This paper investigates the performance of online dynamic speed scaling algorithms for the objective of minimizing a linear combination of energy and response time. We prove that (SRPT, P--1 (n)), which uses Shortest Remaining Processing Time (SRPT) scheduling and processes at speed such that the power used is equal to the queue length, is 2-competitive for a very wide class of power-speed tradeoff functions. Further, we prove that there exist tradeoff functions such that no online algorithm can attain a competitive ratio less than 2.