Optimality, fairness, and robustness in speed scaling designs

Authors:
Lachlan L.H. Andrew;Minghong Lin;Adam Wierman
Affiliations:
Swinburne University of Technology, Hawthorn, Australia;California Institute of Technology, Pasadena, CA, USA;California Institute of Technology, Pasadena, CA, USA
Venue:
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2010

Citing 18
Cited 13

Elements of information theory

Elements of information theory
Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling in the dark

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Asymptotic convergence of scheduling policies with respect to slowdown

Performance Evaluation
Dynamic Control of a Queue with Adjustable Service Rate

Operations Research
Analysis of LAS scheduling for job size distributions with high variance

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Classifying scheduling policies with respect to unfairness in an M/GI/1

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A scheduling model for reduced CPU energy

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Power-aware scheduling for makespan and flow

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Fairness and classifications

ACM SIGMETRICS Performance Evaluation Review
A resource allocation queueing fairness measure: properties and bounds

Queueing Systems: Theory and Applications
Speed scaling for weighted flow time

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithm for the temperature-aware scheduling problem

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
The Case for Energy-Proportional Computing

Computer
Scheduling for Speed Bounded Processors

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Speed scaling with an arbitrary power function

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Fair greening for DSL broadband access

ACM SIGMETRICS Performance Evaluation Review
Energy-Efficient algorithms for flow time minimization

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

The average response time in a heavy-traffic srpt queue

ACM SIGMETRICS Performance Evaluation Review
Towards more effective utilization of computer systems

Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Greening geographical load balancing

Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A tutorial on amortized local competitiveness in online scheduling

ACM SIGACT News
Greening geographical load balancing

ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Energy-aware capacity scaling in virtualized environments with performance guarantees

Performance Evaluation
Scheduling heterogeneous processors isn't as easy as you think

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Modeling and analyzing power management policies in server farms using stochastic Petri nets

Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Renewable and cooling aware workload management for sustainable data centers

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Power-aware speed scaling in processor sharing systems: Optimality and robustness

Performance Evaluation
Meeting the fairness deadline in speed scaling systems: is turbocharging enough?

ACM SIGMETRICS Performance Evaluation Review
Decoupled speed scaling: Analysis and evaluation

Performance Evaluation
Dynamic right-sizing for power-proportional data centers

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work examines fundamental tradeoffs incurred by a speed scaler seeking to minimize the sum of expected response time and energy use per job. We prove that a popular speed scaler is 2-competitive for this objective and no "natural" speed scaler can do better. Additionally, we prove that energy-proportional speed scaling works well for both Shortest Remaining Processing Time (SRPT) and Processor Sharing (PS) and we show that under both SRPT and PS, gated-static speed scaling is nearly optimal when the mean workload is known, but that dynamic speed scaling provides robustness against uncertain workloads. Finally, we prove that speed scaling magnifies unfairness under SRPT but that PS remains fair under speed scaling. These results show that these speed scalers can achieve any two, but only two, of optimality, fairness, and robustness.