Abstract
The amount of detail to include in a performance model is usually regarded as a judgment to be made by an expert modeler and the question “how much detail is necessary?” is seldom asked and is difficult to answer. However, if a simpler model gives essentially the same performance predictions, it may be more useful than a detailed model. It may solve more quickly, for instance, and may be easier to understand. Or a model for a complex sub-system such as a database server may be usefully simplified so it can be included in larger system models. This paper describes an aggregation process for layered queuing models that reduces the number of queues (called tasks and processors, in layered models) while preserving the total execution demand and the bottleneck characteristics of the detailed model. It demonstrates that this process can greatly reduce the number of tasks and processors with a very small relative error.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandy, K.M., Herzog, U., Woo, L.: Parametric analysis of queuing networks. IBM Journal of Research and Development 19(1), 36–42 (1975)
Kritzinger, P.S., Wyk, S.V., Krzesinski, A.E.: A generalization of Norton’s theorem for multiclass queueing networks. Performance Evaluation 2(2), 98–107 (1982)
Lazowska, E.D., Zahorjan, J., Graham, G.S., Sevcik, K.C.: Quantitative system performance - computer system analysis using queueing network models. Prentice Hall (1984). ISBN: 978-0-13-746975-8
Woodside, C.: The relationship of performance models to data. In: Kounev, S., Gorton, I., Sachs, K. (eds.) SIPEW 2008. LNCS, vol. 5119, pp. 9–28. Springer, Heidelberg (2008)
Layered Queuing Network homepage. http://www.sce.carleton.ca/rads/lqns/
Woodside, M.: Tutorial Introduction to Layered Modeling of Software Performance, Edition 4.0, RADS Lab. http://www.sce.carleton.ca/rads/lqns
Martens, A., Koziolek, H., Becker, S., Reussner, R.: Automatically improve software architecture models for performance, reliability, and cost using evolutionary algorithms. In: Proc. First Joint WOSP/SIPEW International Conference on Performance Engineering, pp. 105–116 (2010)
Franks, G., Al-Omari, T., Woodside, C.M., Das, O., Derisavi, S.: Enhanced Modeling and Solution of Layered Queueing Networks. IEEE Trans. on Software Eng. 35(2) (2009)
Franks, G., Petriu, D., Woodside, M., Xu, J., Tregunno, P.: Layered bottlenecks and their mitigation. In: Proc of 3rd Int. Conference on Quantitative Evaluation of Systems QEST 2006, Riverside, CA, USA, pp. 103–114, September 2006
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Islam, F., Petriu, D., Woodside, M. (2015). Simplifying Layered Queuing Network Models. In: Beltrán, M., Knottenbelt, W., Bradley, J. (eds) Computer Performance Engineering. EPEW 2015. Lecture Notes in Computer Science(), vol 9272. Springer, Cham. https://doi.org/10.1007/978-3-319-23267-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-23267-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23266-9
Online ISBN: 978-3-319-23267-6
eBook Packages: Computer ScienceComputer Science (R0)