The M/M/k with Deterministic Setup Times

Author:

Williams Jalani K.1ORCID,Harchol-Balter Mor1ORCID,Wang Weina1ORCID

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

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 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. Our result is a simple algebraic formula which provides insight into how delay scales with the input parameters. For more details, see the full paper.

Funder

Gates Millennium Scholars Program

National GEM Consortium

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Software

Reference9 articles.

1. Anshul Gandhi Sherwin Doroudi Mor Harchol-Balter and Alan Scheller-Wolf. 2013. Exact analysis of the M/M/k/setup class of Markov chains via Recursive Renewal Reward. In Queueing Syst. 153--166. Anshul Gandhi Sherwin Doroudi Mor Harchol-Balter and Alan Scheller-Wolf. 2013. Exact analysis of the M/M/k/setup class of Markov chains via Recursive Renewal Reward. In Queueing Syst. 153--166.

2. Anshul Gandhi , Varun Gupta , Mor Harchol-Balter , and Michael Kozuch . 2010 a. Optimality Analysis of Energy-Peformance Trade-off for Server Farm Management. In PERFORMANCE 2010 Conference. IFIP WG 7.3 International Symposium on Computer Modeling, Measurement and Evaluation . Namur, Belgium. Anshul Gandhi, Varun Gupta, Mor Harchol-Balter, and Michael Kozuch. 2010a. Optimality Analysis of Energy-Peformance Trade-off for Server Farm Management. In PERFORMANCE 2010 Conference. IFIP WG 7.3 International Symposium on Computer Modeling, Measurement and Evaluation. Namur, Belgium.

3. How Data Center Size Impacts the Effectiveness of Dynamic Power Management. In 49th Annual Allerton Conference on Communication, Control, and Computing;Gandhi Anshul;Urbana-Champaign,2011

4. Server farms with setup costs

5. AutoScale

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3