article

Free access

AMVA techniques for high service time variability

Authors:

Derek L. Eager,

Daniel J. Sorin,

Mary K. VernonAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 28, Issue 1

Pages 217 - 228

https://doi.org/10.1145/345063.339418

Published: 01 June 2000 Publication History

Abstract

Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the “standard” AMVA approximation for non-exponential FCFS queues. We find that this approximation is often inaccurate for FCFS queues with high service time variability. For such queues, we propose and evaluate: (1) AMVA estimates of the mean residual service time at an arrival instant that are much more accurate than the standard AMVA estimate, (2) a new AMVA technique that provides a much more accurate estimate of mean center residence time than the standard AMVA estimate, and (3) a new AMVA technique for computing the mean residence time at a “downstream” queue which has a more bursty arrival process than is assumed in the standard AMVA equations. Together, these new techniques increase the range of applications to which AMVA may be fruitfully applied, so that for example, the memory system architecture of shared memory systems with complex modern processors can be analyzed with these computationally efficient methods.

References

[1]

S. V. Adve, V. S. Adve, M. D. Hill, and M. K. Vernon. Comparison of Hardware and Software Cache Coherence Schemes. In Proc. 18~h Annual Int '1. Syrup. on Computer Architecture, pages 298-308, May 1991.

Digital Library

[2]

V. Adve and M. K. "Vernon. Performance Analysis of Deterministic Routing. IEEE Trans. on Parallel and Distributed Systems, 5(3):225-246, Mar. 1994.

Digital Library

[3]

Y. Bard. A Model of Shared DASD and Multipathing. Comm. ACM, 23(10):564-572, Oct. 1980.

Digital Library

[4]

Y. Bard. A Simple Approach to System Modeling. Performance Evaluation, 1(3):225-248, Aug. 1981.

[5]

(3. E. Bier and M. K. Vernon. Measurement and Prediction of Contention in Muttiprocessor Operating Systems with Scientific Application Workloads. In Proc. 1988 lnt'l. Conf. on Supercoraputin9, pages 9--15, July 1988.

Digital Library

[6]

A. B. Bondi and W. Whitt. The Influence of Service-Time Variability in a Closed Network of Queues. Performance Evaluation, 6(3):219-234, Sept. 1986.

Digital Library

[7]

J. Chen and J. Zhang Further Evaluation of the Recent AMVA-Decomp Technique. Tech. Report 1413, Computer Sciences Dept., Univ. of Wisconsin - Madison, Mar. 2000.

[8]

M. Chiang and C. Sohi. Evaluating Design Choices for Shared Bus Multiprocessors. IEEE Trans. on Computers, 41(3):297-317, friar. 1992.

Digital Library

[9]

P. J. Courtois. Decomposability: Queueing and Co~nputev System AppliCations. Academic Press, New York, 1977.

[10]

D. R. Cox. The Use of Complex Probabi}iti~ in the Theory of Stochastic Processes. In Proc. Cambridge Phil. Soc. 51, 1955.

[11]

A. J. Field and P. G. Harrison. An Analytical Model of the Standard Coherent Interface 'SCI'. In Proc. 1995 International Conference on Parallel Processing, pages I:173-177, Aug. 1995.

[12]

M. I. Frank, A. Agarwal, and M. K. Vernon. LoPC" Modeling Contention in Parallel Algorithms. In Proc. 6th ACM SIGPLAN Syrup. on Principles and Practices of Parallel Programming, pages 276-287, June 1997.

Digital Library

[13]

L. Kleinrock. Queueing Systems Volume 1" Theo,y. John Wiley and Sons, New York, 1975.

Digital Library

[14]

E. Lazowska, .}. Zahorjan, C. Graham, and K. Sevcik. Quantitative S~stem Performance, Computer System Analysis Using Queueing Network Models. Prentice-Hall, Englewood Cliffs, NJ, 1984.

Digital Library

[15]

E. D. Lazowska. The Use of Percentiles in Modeling CPU Service Time Distributions. In K.M. Chandy and M. Reiser (eds.), Computer Performance, North-Holland, pages 53-66, 1977.

[16]

S. T. Leutenegger and IVI. K. Vernon. A Mean Value Performance Analysis of a New Multiproccssor Architecture. in Proc. 1988 A CM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, page.~ 167--176, May 1988.

Digital Library

[17]

D. A. Menasce, O. I. Pentakalos, and Y. Yesha. An Analytic Model of Hierarchical Mass Storage Systems with Network-Attached Storage Devices. In Proc. 1996 A CM Sigmetvics Conference on Measurement and Mode~in9 of Computer Systems, pages 180-189. May 1996.

Digital Library

[18]

S. S. Owicki and A. Agarwal. Evaluating the Performance of Software Cache Coherence. {n Proc. 3rd In~'l. Conf. on A rchitectura~ Support for Programming Languages and Operating Systems, pages 230-242, April 1989.

Digital Library

[19]

J. Patel, M. 3. Carey, and M. K. Vernon. Accurate Modeling of the Hybrid Hash Join Algorithm. In Proc. 1994 A CM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pages 56-66, June 1994.

Digital Library

[20]

X. Qin and J.-L. Boer. A Performance Evaluation of Cluster-Based Architectures. t'n Proc. 1997 A CM Sigme~rics Conference on Measuremen~ and Modeling of Computer Systems, pages 237-247, June 1997.

Digital Library

[21]

M. Reiser. A Queueing Network Analysis of Computer Communication Networks with Window Flow Control. IEEE Trans. on Commun., 27(8):1199-1209, Aug. 1979.

[22]

P. Schweitzer. Approximate Analysis of Multiclass Closed Networks of Queues. In International Conference on Stochastic Control and Optimization, 1979.

[23]

K. Sevcik, A. Levy, S. Tripathi, and J. Zahorja~. Improving Approximations of Aggregated Queuing Network Subsystems. In K.M. Chandy and M. Reiser (eds.), Computer Performance, North-Holland, pages 1-22: 1977.

[24]

D. Sorin, V. Pal, S. Adve, M. Vernon, and D. Wood. Analytic Evaluation of Shared-Memory Systems with ILP Processors. In Proc. 25th Annual Int'l Syrup. on Computer Architecture, pages 180-19t, July 1998.

Digital Library

[25]

J. Torrellas, J. L. Hennessy, and T. Well. AnMysis of Critical Architectural and Program Parameters in a Hierarchical Shared Memory Multiprocessor. In Proc. 1990 A CM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pages 163-172, May 1990.

Digital Library

[26]

T. Tsuei and M. K. Vernon. A Model of Multiprocessor Memory and Bus Interference Validated by System Measurement. IEEE Trans. on Parallel and Distributed Sysiems, Special Issue on Measuremen~ and Evaluation of Parallel and Distributed Systems, 3(6):712-727, Nov. 1992.

Digital Library

[27]

M. K. Vernon, R. Jog, and C. Sohi. Performance Analysis of Hierarchical Cache-Coherent Multiprocessors. Performance Evaluation, 9(4):287-302, Aug. 1989.

Digital Library

[28]

M. K. Vernon, E. D. Lazowska, and J. Zahorjan. An Accurate and Efficient Performance Analysis Technique for Multiprocessor Snooping Cache-Consistency Protocols. In P, vc. t5th Annual lnt'l. Syrup. on Computer Architecture, pages 308-315, May 1988.

Digital Library

[29]

G. M. Voelker, H. A. Jamrozik, M. K. Vernon, H. M. Levy, and E. D. La~owska. Managing Server Load in Global Memory Systems. In Proc. 1997 ACM Si9me~rics Conference on Measurement and Modeling of Computer Systems, pages 127-138, June 1997.

Digital Library

[30]

T. Williams and C. Kelley. gnuplot: An Interactive Plotting Program. Manual, version 3.7, Dec. 1998.

[31]

3. Zahorjan, E. Lazowska, and R. Garner. A Decomposition Approach to Modelling High Service Time Variability. Performance Evaluation, 3(1):35-54, Feb. 1983.

Cited By

Alomari FMenascé DHariri SSill A(2013)Self-protecting and self-optimizing database systemsProceedings of the 2013 ACM Cloud and Autonomic Computing Conference10.1145/2494621.2494631(1-10)Online publication date: 9-Aug-2013
https://dl.acm.org/doi/10.1145/2494621.2494631
Curry GLee MRose OUhrmacher A(2012)An MVA approximation for conwip priority modelingProceedings of the Winter Simulation Conference10.5555/2429759.2430007(1-12)Online publication date: 9-Dec-2012
https://dl.acm.org/doi/10.5555/2429759.2430007
Curry GLee M(2012)An MVA approximation for CONWIP priority modelingProceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC)10.1109/WSC.2012.6465147(1-12)Online publication date: Dec-2012
https://doi.org/10.1109/WSC.2012.6465147
Show More Cited By

Recommendations

AMVA techniques for high service time variability
SIGMETRICS '00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the “standard” AMVA approximation for non-exponential FCFS queues. We find that ...
QD-AMVA

Workload measurements in enterprise systems often lead to observe a dependence between the number of requests running at a resource and their mean service requirements. However, multiclass performance models that feature these dependences are ...
Stability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplines

The stability of a cyclic polling system, with a single server and two infinite-buffer queues, is considered. Customers arrive at the two queues according to independent batch Markovian arrival processes. The first queue is served according to the gated ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 28, Issue 1

Special issue on proceedings of ACM SIGMETRICS 2000

June 2000

327 pages

ISSN:0163-5999

DOI:10.1145/345063

Chairmen:
Alexandre Brandwajn
Univ. of California, Santa Cruz, Santa Cruz
,
Jim Kurose
Univ. of Massachusetts-Amherst, Amherst
,
Phillippe Nain
INRIA Sophia Antipolis, France

Issue’s Table of Contents

SIGMETRICS '00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
June 2000
329 pages
ISBN:1581131941
DOI:10.1145/339331
Chairmen:
Alexandre Brandwajn
Univ. of California, Santa Cruz, Santa Cruz
,
Jim Kurose
Univ. of Massachusetts-Amherst, Amherst
,
Phillippe Nain
INRIA, Sophia Antipolis, France

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2000

Published in SIGMETRICS Volume 28, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
484
Total Downloads

Downloads (Last 12 months)80
Downloads (Last 6 weeks)20

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Alomari FMenascé DHariri SSill A(2013)Self-protecting and self-optimizing database systemsProceedings of the 2013 ACM Cloud and Autonomic Computing Conference10.1145/2494621.2494631(1-10)Online publication date: 9-Aug-2013
https://dl.acm.org/doi/10.1145/2494621.2494631
Curry GLee MRose OUhrmacher A(2012)An MVA approximation for conwip priority modelingProceedings of the Winter Simulation Conference10.5555/2429759.2430007(1-12)Online publication date: 9-Dec-2012
https://dl.acm.org/doi/10.5555/2429759.2430007
Curry GLee M(2012)An MVA approximation for CONWIP priority modelingProceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC)10.1109/WSC.2012.6465147(1-12)Online publication date: Dec-2012
https://doi.org/10.1109/WSC.2012.6465147
Sharifian SMotamedi SAkbari M(2011)A predictive and probabilistic load-balancing algorithm for cluster-based web serversApplied Soft Computing10.1016/j.asoc.2010.01.01711:1(970-981)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.1016/j.asoc.2010.01.017
Cavendish DKoide HOie YGerla M(2010)A Mean Value Analysis approach to transaction performance evaluation of multi‐server systemsConcurrency and Computation: Practice and Experience10.1002/cpe.158222:10(1267-1285)Online publication date: 15-Jun-2010
https://doi.org/10.1002/cpe.1582
Tandon NVarde Ade Melo G(2018)Commonsense Knowledge in Machine IntelligenceACM SIGMOD Record10.1145/3186549.318656246:4(49-52)Online publication date: 22-Feb-2018
https://dl.acm.org/doi/10.1145/3186549.3186562
Sadiq SDasu TDong XFreire JIlyas ILink SMiller MNaumann FZhou XSrivastava D(2018)Data QualityACM SIGMOD Record10.1145/3186549.318655946:4(35-43)Online publication date: 22-Feb-2018
https://dl.acm.org/doi/10.1145/3186549.3186559
Spyropoulos VKotidis Y(2018)DigreeACM SIGMOD Record10.1145/3186549.318655546:4(22-27)Online publication date: 22-Feb-2018
https://dl.acm.org/doi/10.1145/3186549.3186555
Pitoura ETsaparas PFlouris GFundulaki IPapadakos PAbiteboul SWeikum G(2018)On Measuring Bias in Online InformationACM SIGMOD Record10.1145/3186549.318655346:4(16-21)Online publication date: 22-Feb-2018
https://dl.acm.org/doi/10.1145/3186549.3186553
Pargman DEriksson E(2016)At odds with a worldviewInteractions10.1145/300383923:6(36-39)Online publication date: 26-Oct-2016
https://dl.acm.org/doi/10.1145/3003839
Show More Cited By

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 Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents