Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2208828.2208842acmotherconferencesArticle/Chapter ViewAbstractPublication Pagese-energyConference Proceedingsconference-collections
research-article

Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode

Published: 09 May 2012 Publication History

Abstract

Many computer systems change into a sleep mode when idle. While this conserves energy it also increases the average latency. In this paper we quantify the effect of state change times on latency and power consumption for a single queuing system with a sleep mode. We analyze the trade-off between power consumption and latency for Poisson arrivals and do a competitive analysis for worst-case arrivals.
To calculate the latency and power consumption for Poisson arrivals we use a Markov chain. For the competitive analysis we present arrival patterns which result in high latency and energy consumption and prove that these patterns are the worst case.
The latency increases approximately linear with the state change times for both Poisson and worst case arrivals. Power consumption asymptotically approaches 100% when the state change times increase. While this is intuitively clear, we provide an analytic derivation. We conclude that a single system with a single sleep mode must have fast state change times to be able to keep the latency low when conserving energy.

References

[1]
S. Albers. Algorithms for energy saving. Efficient Algorithms, pages 173--186, 2009.
[2]
L. L. Andrew, A. Wierman, and A. Tang. Optimal speed scaling under arbitrary power functions. ACM SIGMETRICS Performance Evaluation Review, 37(2):39, Oct. 2009.
[3]
P. Baptiste, M. Chrobak, and C. Dürr. Polynomial time algorithms for minimum energy scheduling. In Proceedings of the 15th annual European conference on Algorithms, pages 136--150. Springer-Verlag, 2007.
[4]
L. Benini, a. Bogliolo, G. Paleologo, and G. De Micheli. Policy optimization for dynamic power management. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(6):813--833, June 1999.
[5]
J. L. Berral, I. Goiri, R. Nou, F. Julià, J. Guitart, R. Gavaldà, and J. Torres. Towards energy-aware scheduling in data centers using machine learning. Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking - e-Energy '10, 2:215, 2010.
[6]
P. Bohrer, E. Elnozahy, T. Keller, M. Kistler, C. Lefurgy, C. McDowell, and R. Rajamony. The case for power management in web servers. Power aware computing, 62, 2002.
[7]
G. Bolch. Queueing networks and Markov chains: modeling and performance evaluation with computer science applications. Wiley-Interscience Publication. Wiley, 1998.
[8]
A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 2005.
[9]
J. Chan, T. Lam, K. Mak, and P. Wong. Online deadline scheduling with bounded energy efficiency. Theory and Applications of Models of Computation, pages 416--427, 2007.
[10]
Y. Chen and F. Xia. Stochastic Modeling Of Dynamic Power Management Policies And Analysis Of Their Power-Latency Tradeoffs. Computer Engineering, (November), 2007.
[11]
Y. Chen, F. Xia, D. Shang, and a. Yakovlev. Fine-grain stochastic modelling of dynamic power management policies and analysis of their power--latency tradeoffs. IET Software, 3(6):458, 2009.
[12]
G. De Micheli. Comparing system level power management policies. IEEE Design & Test of Computers, 18(2):10--19, 2001.
[13]
D. P. Heyman. Optimal Operating Policies for M/G/1 Queueing Systems. Annals of Physics, 54(2):362--382, 1969.
[14]
S. Irani and K. Pruhs. Algorithmic problems in power management. ACM SIGACT News, 36(2):63--76, 2005.
[15]
S. Irani, S. Shukla, and R. Gupta. Competitive analysis of dynamic power management strategies for systems with multiple power saving states. Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition, pages 117--123, 2002.
[16]
T. Lam, L. Lee, H. Ting, I. To, and P. Wong. Sleep with guilt and work faster to minimize flow plus energy. Automata, Languages and Programming, pages 665--676, 2009.
[17]
F. Li. Competitive Scheduling of Packets with Hard Deadlines in a Finite Capacity Queue. IEEE INFOCOM 2009 - The 28th Conference on Computer Communications, pages 1062--1070, Apr. 2009.
[18]
R. Nelson. Probability, stochastic processes, and queueing theory: the mathematics of computer performance modelling. Springer, 1995.
[19]
G. Norman, D. Parker, M. Kwiatkowska, S. Shukla, and R. Gupta. Formal analysis and validation of continuous-time Markov chain based system level power management strategies. In hldvt, pages 45--50. IEEE, 2002.
[20]
M. Pedram. Dynamic power management based on continuous-time Markov decision processes. Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361), (c):555--561, 1999.
[21]
K. Pruhs. Competitive online scheduling for server systems. ACM SIGMETRICS Performance Evaluation Review, 34(4):52--58, 2007.
[22]
Q. Qiu and Q. Wu. Dynamic power management of complex systems using generalized stochastic Petri nets. Proceedings of the 37th Annual Design, pages 352--356, 2000.
[23]
Z. Ren, B. Krogh, and R. Marculescu. Hierarchical adaptive dynamic power management. IEEE Transactions on Computers, 17(3):409--420, Mar. 2005.
[24]
T. Simunic, T. Benini, and G. de Micheli. Quantitative comparison of power management algorithms. Proceedings Design, Automation and Test in Europe Conference and Exhibition 2000 (Cat. No. PR00537), pages 20--26.
[25]
S. Stidham Jr. On the optimality of single-server queuing systems. Operations Research, 18(4):708--732, 1970.
[26]
C. Tian-zhou, H. Jiang-wei, and D. Hong-jun. The dynamic power management for embedded system with Poisson process. Journal of Zhejiang University SCIENCE, 6(Suppl. I):70--74, Aug. 2004.
[27]
F. Zhang and S. Chanson. Power-aware processor scheduling under average delay constraints. 11th IEEE Real Time and Embedded Technology and Applications Symposium, pages 202--212, 2005.

Cited By

View all
  • (2019)Differentiated Latency in Data Center Networks with Erasure Coded Files Through Traffic EngineeringIEEE Transactions on Cloud Computing10.1109/TCC.2017.26487857:2(495-508)Online publication date: 1-Apr-2019

Index Terms

  1. Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    e-Energy '12: Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
    May 2012
    250 pages
    ISBN:9781450310550
    DOI:10.1145/2208828
    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]

    Sponsors

    • IEEE-CS\DATC: IEEE Computer Society

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 09 May 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. competitive analysis
    2. power-saving algorithms

    Qualifiers

    • Research-article

    Conference

    e-Energy'12
    Sponsor:
    • IEEE-CS\DATC

    Acceptance Rates

    Overall Acceptance Rate 160 of 446 submissions, 36%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 04 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Differentiated Latency in Data Center Networks with Erasure Coded Files Through Traffic EngineeringIEEE Transactions on Cloud Computing10.1109/TCC.2017.26487857:2(495-508)Online publication date: 1-Apr-2019

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media