How to parameterize models with bursty workloads

Author:

Casale Giuliano1,Mi Ningfang1,Cherkasova Ludmila2,Smirni Evgenia1

Affiliation:

1. College of William and Mary, Williamsburg, VA

2. Hewlett-Packard Labs, Palo Alto, CA

Abstract

Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g.,MAP queueing networks [2]), there is a lack of understanding and of practical results on how to perform model parameterization, especially when this parameterization must be derived from limited coarse measurements. We propose a new parameterization methodology based on the index of dispersion of the service process at a server, which is inferred by observing the number of completions within the concatenated busy periods of that server. The index of dispersion together with other measurements that reflect the "estimated" mean and the 95th percentile of service times are used to derive a MAP process that captures well burstiness of the true service process. Detailed experimentation on a TPC-W testbed where all measurements are obtained via a commercially available tool, the HP (Mercury) Diagnostics, shows that the proposed technique offers a simple yet powerful solution to the difficult problem of inferring accurate descriptors of the service time process from coarse measurements. Experimental and model prediction results are in excellent agreement and argue strongly for the effectiveness of the proposed methodology under bursty or simply variable workloads.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Software

Reference12 articles.

1. A Markovian approach for modeling packet traffic with long-range dependence

2. Bound analysis of closed queueing networks with workload burstiness

3. G. Casale E. Zhang and E. Smirni. Interarrival times characterization and fitting for markovian traffic analysis. Number WM-CS-2008-02. Available at http://www.wm.edu/computerscience/techreport/2008/WM-CS-2008-02.pdf. G. Casale E. Zhang and E. Smirni. Interarrival times characterization and fitting for markovian traffic analysis. Number WM-CS-2008-02. Available at http://www.wm.edu/computerscience/techreport/2008/WM-CS-2008-02.pdf.

4. KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes

5. TPC-W e-commerce benchmark evaluation

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Optimizing inference serving on serverless platforms;Proceedings of the VLDB Endowment;2022-06

2. Context‐aware resource management and alternative pricing model to improve enterprise cloud adoption;Concurrency and Computation: Practice and Experience;2020-11-17

3. BATCH: Machine Learning Inference Serving on Serverless Platforms with Adaptive Batching;SC20: International Conference for High Performance Computing, Networking, Storage and Analysis;2020-11

4. SpotWeb;Proceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing;2019-06-17

5. Non-linear analysis of bursty workloads using dual metrics for better cloud resource management;Journal of Ambient Intelligence and Humanized Computing;2019-01-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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