research-article

Open access

The M/M/k with Deterministic Setup Times

Authors:

Jalani K. Williams,

Mor Harchol-Balter,

Weina WangAuthors Info & Claims

Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 6, Issue 3

Article No.: 56, Pages 1 - 45

https://doi.org/10.1145/3570617

Published: 08 December 2022 Publication History

Abstract

Capacity management, whether it involves servers in a data center, or human staff in a call center, or doctors in a hospital, is largely about balancing a resource-delay tradeoff. On the one hand, one would like to turn off servers when not in use (or send home staff that are idle) to save on resources. On the other hand, one wants to avoid the considerable setup time required to turn an ''off'' server back ''on.'' This paper aims to understand the delay component of this tradeoff, namely, what is the effect of setup time on average delay in a multi-server system?

Surprisingly little is known about the effect of setup times on delay. While there has been some work on studying the M/M/k with Exponentially-distributed setup times, these works provide only iterative methods for computing mean delay, giving little insight as to how delay is affected by k, by load, and by the setup time. Furthermore, setup time in practice is much better modeled by a Deterministic random variable, and, as this paper shows, the scaling effect of a Deterministic setup time is nothing like that of an Exponentially-distributed setup time.

This paper provides the first analysis of the M/M/k with Deterministic setup times. We prove a lower bound on the effect of setup on delay, where our bound is highly accurate for the common case where the setup time is much higher than the job service time. Our result is a relatively simple algebraic formula which provides insights on how delay scales with the input parameters. Our proof uses a combination of renewal theory, martingale arguments and novel probabilistic arguments, providing strong intuition on the transient behavior of a system that turns servers on and off.

References

[1]

J. R. Artalejo, A. Economou, and M. J. Lopez-Herrero. Analysis of a Multiserver Queue with Setup Times. Queueing Syst., 51(1):53--76, 2005.

Digital Library

[2]

S. Asmussen. Applied Probability and Queues, volume 2. Springer, 2003.

[3]

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

Digital Library

[4]

G. Choudhury. On a batch arrival Poisson queue with a random setup time and vacation period. Comp. & Oper. Res., 25(12):1013--1026, 1998.

Digital Library

[5]

A. Gandhi and M. Harchol-Balter. How Data Center Size Impacts the Effectiveness of Dynamic Power Management. In Proc. Ann. Allerton Conf. Communication, Control and Computing, pages 1164--1169, Urbana-Champaign, IL, September 2011.

[6]

A. Gandhi and M. Harchol-Balter. M/G/k with staggered setup. Oper. Res. Lett., 41(4):317--320, 2013.

[7]

A. Gandhi, V. Gupta, M. Harchol-Balter, and M. Kozuch. Optimality analysis of energy-performance trade-off for server farm management. In Proc. Int. Symp. Computer Performance, Modeling, Measurements and Evaluation (IFIP Performance), Namur, Belgium, November 2010.

Digital Library

[8]

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

Digital Library

[9]

A. Gandhi, M. Harchol-Balter, and M. Kozuch. The case for sleep states in servers. In SOSP Workshop on Power-Aware Computing and Systems (HotPower), pages 1--5, Cascais, Portugal, October 2011.

Digital Library

[10]

A. Gandhi, M. Harchol-Balter, and M. Kozuch. Are sleep states effective in data centers? In Int. Conf. Green Computing (IGCC), pages 1--10, San Jose, CA, 2012.

Digital Library

[11]

A. Gandhi, M. Harchol-Balter, R. Raghunathan, and M. A. Kozuch. AutoScale: Dynamic, Robust Capacity Management for Multi-Tier Data Centers. ACM Trans. Comput. Syst., 30(4):1--26, 2012.

Digital Library

[12]

A. Gandhi, S. Doroudi, M. Harchol-Balter, and A. Scheller-Wolf. Exact analysis of the M/M/k/setup class of Markov chains via Recursive Renewal Reward. In Queueing Syst., pages 153--166, 2013.

Digital Library

[13]

Q.-M. He and E. Jewkes. Flow time in the MAP/G/1 queue with customer batching and setup times. Stochastic Models, 11(4):691--711, 1995.

[14]

E. Hyytiä, D. Down, P. Lassila, and S. Aalto. Dynamic Control of Running Servers. In Int. Conf. Measurement, Modelling and Evaluation of Comput. Systems, pages 127--141, Erlangen, Germany, 2018. Springer.

[15]

A. Kara. Energy Consumption in Data Centers with Deterministic Setup Times. Master's thesis, Middle East Technical University, 2017.

[16]

M. Mao and M. Humphrey. A Performance Study on the VM Startup Time in the Cloud. In IEEE Int. Conf. Cloud Computing (CLOUD), pages 423--430, Honolulu, HI, 2012.

Digital Library

[17]

D. Mukherjee and A. Stolyar. Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System. Stoch. Syst., 9(4):338--358, 2019.

[18]

D. Mukherjee, S. Dhara, S. C. Borst, and J. S. van Leeuwaarden. Optimal Service Elasticity in Large-Scale Distributed Systems. Proc. ACM SIGMETRICS Int. Conf. Measurement and Modeling of Computer Systems, 1:1--28, 2017.

Digital Library

[19]

J. Pender and T. Phung-Duc. A law of large numbers for m/m/c/delayoff-setup queues with nonstationary arrivals. In Int. Conf. on Analytical and Stochastic Modeling Techniques and Applications, pages 253--268, Cardiff, UK, 2016. Springer.

[20]

T. Phung-Duc. Exact solutions for M/M/c/setup queues. Telecommun. Syst., 64(2):309--324, 2017.

Digital Library

[21]

K. Rzadca, P. Findeisen, J. Swiderski, P. Zych, P. Broniek, J. Kusmierek, P. Nowak, B. Strack, P. Witusowski, S. Hand, et al. Autopilot: workload autoscaling at Google. In Proc. European Conf. Computer Systems (EuroSys), pages 1--16, Heraklion, Crete, Greece, 2020.

[22]

P. D. Welch. On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service. Oper. Res., 12(5):736--752, 1964.

Digital Library

Cited By

Hong YScully Z(2024)Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup TimesACM SIGMETRICS Performance Evaluation Review10.1145/3649477.364948551:4(12-13)Online publication date: 23-Feb-2024
https://dl.acm.org/doi/10.1145/3649477.3649485
Hong YScully Z(2024)Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup timesPerformance Evaluation10.1016/j.peva.2023.102377163:COnline publication date: 16-May-2024
https://dl.acm.org/doi/10.1016/j.peva.2023.102377
Williams JHarchol-Balter MWang W(2023)The M/M/k with Deterministic Setup TimesACM SIGMETRICS Performance Evaluation Review10.1145/3606376.359357551:1(75-76)Online publication date: 27-Jun-2023
https://dl.acm.org/doi/10.1145/3606376.3593575

Index Terms

The M/M/k with Deterministic Setup Times
1. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory
    2. Stochastic processes
      1. Markov processes

Recommendations

The M/M/k with Deterministic Setup Times
SIGMETRICS '23

Capacity management, whether it involves servers in a data center, or human staff in a call center, or doctors in a hospital, is largely about balancing a resource-delay tradeoff. On the one hand, one would like to turn off servers when not in use (or ...
The M/M/k with Deterministic Setup Times
SIGMETRICS '23: Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Capacity management, whether it involves servers in a data center, or human staff in a call center, or doctors in a hospital, is largely about balancing a resource-delay tradeoff. On the one hand, one would like to turn off servers when not in use (or ...
Priority Queues with Setup Times

<P>Queueing analysis is conducted for M/G/1-type systems with multiple classes of service requests that need a setup time prior to each busy period. We consider a variety of service disciplines: FCFS first-come, first-served, LCFS last-come, first-...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Measurement and Analysis of Computing Systems

Proceedings of the ACM on Measurement and Analysis of Computing Systems Volume 6, Issue 3

POMACS

December 2022

534 pages

EISSN:2476-1249

DOI:10.1145/3576048

Editors:
Augustin Chaintreau
Columbia University
,
Leana Golubchik
University of Southern California, United States
,
Zhi-Li Zhang
University of Minnesota, United States

Issue’s Table of Contents

Copyright © 2022 Owner/Author.

This work is licensed under a Creative Commons Attribution International 4.0 License.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 December 2022

Published in POMACS Volume 6, Issue 3

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

NSF
Gates Foundation
GEM Consortium

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
233
Total Downloads

Downloads (Last 12 months)149
Downloads (Last 6 weeks)12

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hong YScully Z(2024)Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup TimesACM SIGMETRICS Performance Evaluation Review10.1145/3649477.364948551:4(12-13)Online publication date: 23-Feb-2024
https://dl.acm.org/doi/10.1145/3649477.3649485
Hong YScully Z(2024)Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup timesPerformance Evaluation10.1016/j.peva.2023.102377163:COnline publication date: 16-May-2024
https://dl.acm.org/doi/10.1016/j.peva.2023.102377
Williams JHarchol-Balter MWang W(2023)The M/M/k with Deterministic Setup TimesACM SIGMETRICS Performance Evaluation Review10.1145/3606376.359357551:1(75-76)Online publication date: 27-Jun-2023
https://dl.acm.org/doi/10.1145/3606376.3593575

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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 Article

Media

Figures

Other

Tables

View Issue’s Table of Contents