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