Skip to main content

Impatient Customers in Power-Saving Data Centers

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8499))

Abstract

In data centers, there are a huge number of servers which consume a large amount of energy. Reducing a few percent of the power consumption leads to saving a large amount of money and also saving our environment. In the current technology, an idle server still consumes about 60% of its peak and thus a simple way to save energy is shutdown of idle servers. However, when the workload increases, we have to turn on the OFF servers. A server needs some setup time to be active during which the server consumes energy but cannot process any job. Furthermore, a waiting job may abandon without service after a long waiting time which may be incurred by setup times. In this paper, we consider the power saving and the performance trade-off in data centers through a multiserver queueing model with setup time and impatient customers. We formulate the system by a level-dependent QBD process obtaining the stationary distribution and some performance measures. Our numerical results provide various insights into the performance of the system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Artalejo, J.R., Economou, A., Lopez-Herrero, M.J.: Analysis of a multiserver queue with setup times. Queueing Systems 51, 53–76 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barroso, L.A., Holzle, U.: The case for energy-proportional computing. Computer 40, 33–37 (2007)

    Article  Google Scholar 

  3. Bischof, W.: Analysis of M/G/1-Queues with Setup Times and Vacations under Six Different Service Disciplines. Queueing Systems: Theory and Applications 39, 265–301 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Choudhury, G.: On a batch arrival Poisson queue with a random setup time and vacation period. Computers and Operations Research 25, 1013–1026 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Choudhury, G.: An MX/G/1 queueing system with a setup period and a vacation period. Queueing Systems: Theory and Applications 36, 23–38 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gandhi, A., Harchol-Balter, M., Adan, I.: Server farms with setup costs. Performance Evaluation 67, 1123–1138 (2010)

    Article  Google Scholar 

  7. Gandhi, A., Gupta, V., Harchol-Balter, M., Kozuch, M.A.: Optimality analysis of energy-performance trade-off for server farm management. Performance Evaluation 67, 1155–1171 (2010)

    Article  Google Scholar 

  8. Gandhi, A., Harchol-Balter, M.: M/G/k with staggered setup. Operations Research Letters 41, 317–320 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  9. Latouche, G.: Ramaswami, Introduction to matrix analytic methods in stochastic modeling. SIAM (1999)

    Google Scholar 

  10. Mitrani, I.: Service center trade-offs between customer impatience and power consumption. Performance Evaluation 68, 1222–1231 (2011)

    Article  Google Scholar 

  11. Mitrani, I.: Trading power consumption against performance by reserving blocks of servers. In: Tribastone, M., Gilmore, S. (eds.) EPEW/UKPEW 2012. LNCS, vol. 7587, pp. 1–15. Springer, Heidelberg (2013)

    Google Scholar 

  12. Mitrani, I.: Managing performance and power consumption in a server farm. Annals of Operations Research 202, 121–134 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  13. Phung-Duc, T., Masuyama, H., Kasahara, S., Takahashi, Y.: A simple algorithm for the rate matrices of level-dependent QBD processes. In: Proceedings of the 5th International Conference on Queueing Theory and Network Applications, pp. 46–52. ACM (2010)

    Google Scholar 

  14. Phung-Duc, T., Masuyama, H., Kasahara, S., Takahashi, Y.: A matrix continued fraction approach to multiserver retrial queues. Annals of Operations Research 202, 161–183 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ramaswami, V., Taylor, P.G.: Some properties of the rate operations in level dependent quasi-birth-and-death processes with countable number of phases. Stochastic Models 12, 143–164 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Slegers, J., Thomas, N., Mitrani, I.: Dynamic server allocation for power and performance. In: Kounev, S., Gorton, I., Sachs, K. (eds.) SIPEW 2008. LNCS, vol. 5119, pp. 247–261. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Takagi, H.: Priority queues with setup times. Operations Research 38, 667–677 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Phung-Duc, T. (2014). Impatient Customers in Power-Saving Data Centers. In: Sericola, B., Telek, M., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2014. Lecture Notes in Computer Science, vol 8499. Springer, Cham. https://doi.org/10.1007/978-3-319-08219-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08219-6_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08218-9

  • Online ISBN: 978-3-319-08219-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics