Speed scaling : An algorithmic perspective

Speed scaling has long been used as a power-saving mechanism at a chip level. However, in recent years, speed scaling has begun to be used as an approach for trading off energy usage and performance throughout all levels of computer systems. This wide-spread use of speed scaling has motivated significant research on the topic, but many fundamental questions about speed scaling are only beginning to be understood. In this chapter, we focus on a simple, but general, model of speed scaling and provide an algorithmic perspective on four fundamental questions: (i) What is the structure of the optimal speed scaling algorithm? (ii) How does speed scaling interact with scheduling? (iii) What is the impact of the sophistication of speed scaling algorithms? and (iv) Does speed scaling have any unintended consequences? For each question we provide a summary of insights from recent work on the topic in both worst-case and stochastic analysis as well as a discussion of interesting open questions that remain.

[1]  Karam S. Chatha,et al.  Approximation algorithm for the temperature-aware scheduling problem , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[2]  Kirk Pruhs,et al.  Nonclairvoyant Speed Scaling for Flow and Energy , 2010, Algorithmica.

[3]  J. Michael Harrison,et al.  Dynamic Control of a Queue with Adjustable Service Rate , 2001, Oper. Res..

[4]  Prudence W. H. Wong,et al.  Nonmigratory Multiprocessor Scheduling for Response Time and Energy , 2008, IEEE Transactions on Parallel and Distributed Systems.

[5]  Kirk Pruhs,et al.  Getting the best response for your erg , 2004, TALG.

[6]  Jeffrey S. Chase,et al.  Balance of power: dynamic thermal management for Internet data centers , 2005, IEEE Internet Computing.

[7]  M. Meerschaert.  Regular Variation in R k , 1988 .

[8]  Susanne Albers,et al.  Energy-efficient algorithms for flow time minimization , 2006, STACS.

[9]  Stephen V. Hanly,et al.  Congestion measures in DS-CDMA networks , 1999, IEEE Trans. Commun..

[10]  A. Wierman,et al.  Optimality, fairness, and robustness in speed scaling designs , 2010, SIGMETRICS '10.

[11]  Adam Wierman,et al.  Fairness and classifications , 2007, PERV.

[12]  R. Weber,et al.  Optimal control of service rates in networks of queues , 1987, Advances in Applied Probability.

[13]  Seong-Lyun Kim,et al.  Combined power control and transmission rate selection in cellular networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[14]  W. Sandmann,et al.  A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement , 2005, Next Generation Internet Networks, 2005.

[15]  Kirk Pruhs,et al.  How to Schedule When You Have to Buy Your Energy , 2010, APPROX-RANDOM.

[16]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[17]  Alexander Souza,et al.  The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling , 2013, Theory of Computing Systems.

[18]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[19]  Adam Wierman,et al.  Classifying scheduling policies with respect to unfairness in an M/GI/1 , 2003, SIGMETRICS '03.

[20]  Minghong Lin,et al.  Heavy-traffic analysis of mean response time under Shortest Remaining Processing Time , 2011, Perform. Evaluation.

[21]  Paschalis Tsiaflakis,et al.  Fair greening for DSL broadband access , 2010, PERV.

[22]  Anantha P. Chandrakasan,et al.  Low-power CMOS digital design , 1992 .

[23]  Kirk Pruhs,et al.  Speed scaling for weighted flow time , 2007, SODA '07.

[24]  Nikhil Bansal,et al.  Scheduling for Speed Bounded Processors , 2008, ICALP.

[25]  R. Núñez Queija,et al.  TCP as an Implementation of Age-Based Scheduling: Fairness and Performance , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[26]  Susanne Albers,et al.  Speed Scaling on Parallel Processors , 2007, SPAA '07.

[27]  T. B. Crabill.  Optimal Control of a Service Facility with Variable Exponential Service Times and Constant Arrival Rate , 1972 .

[28]  Peng Zhang,et al.  Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors , 2011, Chic. J. Theor. Comput. Sci..

[29]  Kirk Pruhs,et al.  Speed Scaling with an Arbitrary Power Function , 2009, TALG.

[30]  Luiz André Barroso,et al.  The Case for Energy-Proportional Computing , 2007, Computer.

[31]  Lachlan L. H. Andrew,et al.  Dynamic Right-Sizing for Power-Proportional Data Centers , 2011, IEEE/ACM Transactions on Networking.

[32]  Prudence W. H. Wong,et al.  Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count , 2008, ESA.

[33]  Adam Wierman,et al.  Approximate dynamic programming using fluid and diffusion approximations with applications to power management , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[34]  Miodrag Potkonjak,et al.  Energy minimization for real-time systems with non-convex and discrete operation modes , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

[35]  Mahmut T. Kandemir,et al.  Energy-aware data prefetching for multi-speed disks , 2006, CF '06.

[36]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[37]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[38]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[39]  Margaret Martonosi,et al.  Computer Architecture Techniques for Power-Efficiency , 2008, Computer Architecture Techniques for Power-Efficiency.

[40]  Mor Harchol-Balter,et al.  Optimality analysis of energy-performance trade-off for server farm management , 2010, Perform. Evaluation.

[41]  Kirk Pruhs,et al.  Speed scaling to manage energy and temperature , 2007, JACM.

[42]  Kirk Pruhs,et al.  Speed Scaling of Tasks with Precedence Constraints , 2005, Theory of Computing Systems.

[43]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2006, SPAA '06.

[44]  Guillaume Urvoy-Keller,et al.  Analysis of LAS scheduling for job size distributions with high variance , 2003, SIGMETRICS '03.

[45]  Kirk Pruhs,et al.  Speed scaling with a solar cell , 2009, Theor. Comput. Sci..

[46]  Adam Wierman,et al.  Asymptotic convergence of scheduling policies with respect to slowdown , 2002, Perform. Evaluation.

[47]  Wen-Jing Hsu,et al.  Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors , 2009, CF '09.

[48]  James R. Bradley.  Optimal control of a dual service rate M/M/1 production-inventory model , 2005, Eur. J. Oper. Res..

[49]  Lachlan L. H. Andrew,et al.  Power-Aware Speed Scaling in Processor Sharing Systems , 2009, IEEE INFOCOM 2009.

[50]  Prudence W. H. Wong,et al.  Competitive non-migratory scheduling for flow time and energy , 2008, SPAA '08.

[51]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[52]  Kirk Pruhs,et al.  Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule , 2009, ICALP.