research-article

Optimality, fairness, and robustness in speed scaling designs

Authors:

Lachlan L.H. Andrew,

Adam WiermanAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 38, Issue 1

Pages 37 - 48

https://doi.org/10.1145/1811099.1811044

Published: 14 June 2010 Publication History

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.

References

[1]

S. Albers and H. Fujiwara. Energy-efficient algorithms for flow time minimization. In Lecture Notes in Computer Science (STACS), volume 3884, pages 621--633, 2006.

Digital Library

[2]

B. Avi-Itzhak, H. Levy, and D. Raz. A resource allocation fairness measure: properties and bounds. Queueing Systems Theory and Applications, 56(2):65--71, 2007.

Digital Library

[3]

N. Bansal, H.-L. Chan, J. Edmonds, and K. Pruhs. Preprint, 2009. Available http://www.cs.pitt.edu/kirk/postdoc/spaa.pdf.

[4]

N. Bansal, H.-L. Chan, T.-W. Lam, and L.-K. Lee. Scheduling for speed bounded processors. In Proc. Int Colloq. Automata, Languages and Programming, pages 409--420, 2008.

Digital Library

[5]

N. Bansal, H.-L. Chan, and K. Pruhs. Speed scaling with an arbitrary power function. In Proc. SODA, 2009.

Digital Library

[6]

N. Bansal, H.-L. Chan, K. Pruhs, and D. Katz. Improved bounds for speed scaling in devices obeying the cube-root rule. In Automata, Languages and Programming, pages 144--155, 2009.

Digital Library

[7]

N. Bansal, K. Pruhs, and C. Stein. Speed scaling for weighted flow times. In Proc. SODA, pages 805--813, 2007.

Digital Library

[8]

L. A. Barroso and U. H¨olzle. The case for energy proportional computing. Computer, 40(12):33--37, 2007.

Digital Library

[9]

N. Bingham, C. Goldie, and J. Teugels. Regular Variation. Cambridge University Press, 1987.

[10]

J. R. Bradley. Optimal control of a dual service rate M/M/1 production-inventory model. European Journal of Operations Research, 161(3):812--837, 2005.

[11]

D. P. Bunde. Power-aware scheduling for makespan and flow. In Proc. ACM Symp. Parallel Alg. and Arch., 2006.

Digital Library

[12]

H.-L. Chan, J. Edmonds, T.-W. Lam, L.-K. Lee, A. Marchetti-Spaccamela, and K. Pruhs. Nonclairvoyant speed scaling for flow and energy. In Proc. STACS, 2009.

[13]

T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.

Digital Library

[14]

T. B. Crabill. Optimal control of a service facility with variable exponential service times and constant arrival rate. Management Science, 18(9):560--566, 1972.

[15]

J. Edmonds. Scheduling in the dark. In Proc. ACM STOC, pages 179--188, 1999.

Digital Library

[16]

J. M. George and J. M. Harrison. Dynamic control of a queue with adjustable service rate. Oper. Res., 49(5):720--731, 2001.

Digital Library

[17]

S. V. Hanly. Congestion measures in DS-CDMA networks. IEEE Trans. Commun., 47(3):426--437, Mar. 1999.

[18]

M. Harchol-Balter, K. Sigman, and A. Wierman. Asymptotic convergence of scheduling policies with respect to slowdown. Perf. Eval., 49(1--4):241--256, Sept. 2002.

Digital Library

[19]

F. P. Kelly. Reversibility and Stochastic Networks. 1979.

[20]

A. A. Kherani and R. Nunez-Queija. TCP as an implementation of age-based scheduling: fairness and performance. In IEEE INFOCOM, 2006.

[21]

L. Kleinrock. Queueing Systems Volume II: Computer Applications. Wiley Interscience, 1976.

[22]

T.-W. Lam, L.-K. Lee, I. K. K. To, and P. W. H. Wong. Speed scaling functions for flow time scheduling based on active job count. In Proc. Euro. Symp. Alg., 2009.

Digital Library

[23]

M. Lin, A. Wierman, and B. Zwart. Heavy-traffic analysis of mean response time under shortest remaining processing time. Preprint, 2009.

[24]

R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoret. Comput. Sci., 130(1):17--47, 1994.

Digital Library

[25]

K. Pruhs, P. Uthaisombut, and G. Woeginger. Getting the best response for your erg. In Scandinavian Worksh. Alg. Theory, 2004.

[26]

I. A. Rai, G. Urvoy-Keller, and E. Biersack. Analysis of FB scheduling for job size distributions with high variance. In Proc. of ACM Sigmetrics, 2003.

Digital Library

[27]

W. Sandmann. A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement. In Proc. of Euro NGI Conf. on Next Generation Int. Nets, 2005.

[28]

R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6(2):306--318, 1985.

Digital Library

[29]

P. Tsiaflakis, Y. Yi, M. Chiang, and M. Moonen. Fair greening for DSL broadband access. In GreenMetrics, 2009.

Digital Library

[30]

R. Weber and S. Stidham. Optimal control of service rates in networks of queues. Adv. Appl. Prob., 19:202--218, 1987.

[31]

A. Wierman. Fairness and classifications. Perf. Eval. Rev., 34(4):4--12, 2007.

Digital Library

[32]

A. Wierman, L. L. H. Andrew, and A. Tang. Power-aware speed scaling in processor sharing systems. In Proc. IEEE INFOCOM, 2009.

[33]

A. Wierman and M. Harchol-Balter. Classifying scheduling policies with respect to unfairness in an M/GI/1. In Proc. of ACM Sigmetrics, 2003.

Digital Library

[34]

F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), pages 374--382, 1995.

Digital Library

[35]

S. Zhang and K. S. Catha. Approximation algorithm for the temperature-aware scheduling problem. In Proc. IEEE Int. Conf. Comp. Aided Design, pages 281--288, Nov. 2007.

Digital Library

Cited By

Wu XHe A(2025)Multimodal information fusion and artificial intelligence approaches for sustainable computing in data centersPattern Recognition Letters10.1016/j.patrec.2024.12.006Online publication date: Jan-2025
https://doi.org/10.1016/j.patrec.2024.12.006
der Boor MBorst SVan Leeuwaarden JMukherjee D(2022)Scalable Load Balancing in Networked Systems: A Survey of Recent AdvancesSIAM Review10.1137/20M132374664:3(554-622)Online publication date: 4-Aug-2022
https://doi.org/10.1137/20M1323746
Vaze RNair J(2022)Speed Scaling on Parallel Servers With MapReduce Type Precedence ConstraintsIEEE/ACM Transactions on Networking10.1109/TNET.2022.314209130:4(1509-1524)Online publication date: Aug-2022
https://doi.org/10.1109/TNET.2022.3142091
Show More Cited By

Index Terms

Optimality, fairness, and robustness in speed scaling designs
1. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory

Recommendations

Optimality, fairness, and robustness in speed scaling designs
SIGMETRICS '10: Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems

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 ...
Throughput maximization for speed scaling with agreeable deadlines

We study the following energy-efficient scheduling problem. We are given a set of n jobs which have to be scheduled by a single processor whose speed can be varied dynamically. Each job $$J_j$$Jj is characterized by a processing requirement (work) $$p_j$...
Throughput maximization in multiprocessor speed-scaling

In the classical energy minimization problem, introduced in 24, we are given a set of n jobs each one characterized by its release date, its deadline, its processing volume and we aim to find a feasible schedule of the jobs on a single speed-scalable ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 38, Issue 1

Performance evaluation review

June 2010

382 pages

ISSN:0163-5999

DOI:10.1145/1811099

Issue’s Table of Contents

SIGMETRICS '10: Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
June 2010
398 pages
ISBN:9781450300384
DOI:10.1145/1811039
General Chair:
Vishal Misra
Columbia University, USA
,
Program Chairs:
Paul Barford
University of Wisconsin-Madison, USA
,
Mark Squillante
IBM T.J. Watson Research Center, USA

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2010

Published in SIGMETRICS Volume 38, Issue 1

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

111
Total Citations
View Citations
537
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wu XHe A(2025)Multimodal information fusion and artificial intelligence approaches for sustainable computing in data centersPattern Recognition Letters10.1016/j.patrec.2024.12.006Online publication date: Jan-2025
https://doi.org/10.1016/j.patrec.2024.12.006
der Boor MBorst SVan Leeuwaarden JMukherjee D(2022)Scalable Load Balancing in Networked Systems: A Survey of Recent AdvancesSIAM Review10.1137/20M132374664:3(554-622)Online publication date: 4-Aug-2022
https://doi.org/10.1137/20M1323746
Vaze RNair J(2022)Speed Scaling on Parallel Servers With MapReduce Type Precedence ConstraintsIEEE/ACM Transactions on Networking10.1109/TNET.2022.314209130:4(1509-1524)Online publication date: Aug-2022
https://doi.org/10.1109/TNET.2022.3142091
Goldsztajn DFerragut APaganini F(2021)Automatic cloud instance provisioning with quality and efficiencyPerformance Evaluation10.1016/j.peva.2021.102209149:COnline publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1016/j.peva.2021.102209
Marin ARossi SWilliamson C(2020)Speed scaling in fork-join queuesProceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools10.1145/3388831.3388845(80-87)Online publication date: 18-May-2020
https://dl.acm.org/doi/10.1145/3388831.3388845
Vaze RNair J(2020)Multiple Server SRPT With Speed Scaling Is CompetitiveIEEE/ACM Transactions on Networking10.1109/TNET.2020.2993142(1-13)Online publication date: 2020
https://doi.org/10.1109/TNET.2020.2993142
Elahi MMarin ARossi SWilliamson C(2020)Frequency scaling in multilevel queuesPerformance Evaluation10.1016/j.peva.2020.102140143(102140)Online publication date: Nov-2020
https://doi.org/10.1016/j.peva.2020.102140
Comden JYao SChen NXing HLiu Z(2019)Online Optimization in Cloud Resource ProvisioningProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/3322205.33110873:1(1-30)Online publication date: 26-Mar-2019
https://dl.acm.org/doi/10.1145/3322205.3311087
Maghakian JComden JLiu Z(2019)Online optimization in the Non-Stationary Cloud: Change Point Detection for Resource Provisioning (Invited Paper)2019 53rd Annual Conference on Information Sciences and Systems (CISS)10.1109/CISS.2019.8692890(1-6)Online publication date: Mar-2019
https://doi.org/10.1109/CISS.2019.8692890
Zhou ZAbawajy JChowdhury MHu ZLi KCheng HAlelaiwi ALi F(2018)Minimizing SLA violation and power consumption in Cloud data centers using adaptive energy-aware algorithmsFuture Generation Computer Systems10.1016/j.future.2017.07.04886(836-850)Online publication date: Sep-2018
https://doi.org/10.1016/j.future.2017.07.048
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents