Abstract
A significant computational gain can be achieved through concurrent programming by exploiting parallel and distributed processing capabilities of current computer system architectures. The performance evaluation and quantitative analysis of such systems have become important due to the multiplicity of the component parts and the complexity of their functioning. In this paper an approximate method is developed for the analysis of general queueing network models of computer systems with variable concurrency and synchronisation structures. It is based on the maximum entropy algorithm and the notion of surrogate delays. Numerical examples illustrate the capability of the proposed algorithm in comparison to simulation.
This work is sponsored by the Science and Engineering Research Council (SERC), UK, under grant GR/F29271
This is a preview of subscription content, log in via an institution to check access.
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
Ben-Ari M. Principles of concurrent and distributed programming. Prentice Hall, Englewood Cliff, N.J., 1990.
Whiddett D. Concurrent programming for software engineers. Ellis Horwood Ltd, Chichester, 1987.
Peterson J. and Bulgren N. Studies in Markov models of computer systems. Proc. ACM Annual Conf., 1975, pp 102–107.
Price T.G. Models of multiprogrammed computer systems with I/O buffering. Proc. 4th Texas Conf. Comp. Syst., Univ. Texas, 1975.
Mackawa M. and Boyd D.L. Two models of task overlap within jobs of multiprocessing multiprogramming systems. Proc. Int. Conf. Parallel Processing, 1976, pp 83–91.
Towsley D., Chandy K.M. and Browne J.C. Models for parallel processing with programs: Applications to CPU:I/0 and 1/0:1/0 Overlap. Com. ACM, 1978, 21, pp 821–831.
Herzog U., Hoffman W. and Kleinoder W. Performance Modelling and Evaluation for hierarchical organised multiprocessor computer systems. Proc. Int. Conf. Parallel Processing, 1979, pp 103–114.
Bard Y. Some extension to multiclass queueing network analysis. Proc. 4th Int. Symp. Model. & Perfor. Eval. Comp. Syst., vol 1,1979.
Sauer C.H. and Chandi K.M. Computer systems performance modelling. Prentice Hall, 1981.
Heidelberger P. and Trivedi K.S. Analytic queueing models for programs with internal concurrency. IEEE Trans. Comp., 1983, C-32, pp 73–82.
Thomaisan A. and Bay P.F. Analytic queueing network models for parallel processing of task systems. IEEE Trans. Comp., 1986, C-35, pp 1045–1054.
Peng D. and Shin K.G. Modelling of concurrent task execution in distributed systems for real-time control. IEE Trans. Comp., 1987, C-36, pp 500–516.
Skliros A.P. and Kouvatsos D.D. General queueing network models with job concurrency and synchronisation. Proc. 5th UK Comp and Telecom. Perf. Eng. Workshop, 1989, Univ. Edinburgh.
Kouvatsos D.D. and Skliros A.P. General queueing network models of parallel task processing computer systems: A comparative study. Proc. 6th UK Comp and Telecom. Perf. Eng. Workshop, 1990, Univ. Bradford.
Kouvatsos D.D. A universal maximum entropy algorithm for the analysis of the general closed networks. In: Hesagawa T. et al (eds) Computer Modelling and Performance Evaluation, North Holland, Amsterdam, 1986, pp 113–124.
Jacobson P.A. and Lazowska E.D. Analyzing queueing networks with simultaneous resource possession. Com. ACM, 1981, pp 142–151
U.S. Department of Defence. Programming language Ada: Reference manual, vol. 106, Lecture notes in Comp. Sci., Springer-Verlag 1981.
Kouvatsos D.D. and Tabet-Aouel N.M. Product-form approximations for an extended class of general closed queueing networks. In: King P.J.B. et al (eds), Performance ‘90, North-Holland, Amsterdam, 1990, pp301–315.
Georgatsos P.H. Modelling and analysis of computer communication networks with random or semidynamic routing, PhD Thesis, Univ. Bradford, 1989
Veran M. and Potier D. A portable environment for queueing network modelling. In: Potier D. (ed), Modelling techniques and tools for performance analysis, North-Holland, Amsterdam, 1985, pp 25–63.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Kouvatsos, D.D., Skliros, A. (1992). General Queueing Network Models with Variable Concurrent Programming Structures and Synchronisation. In: Hillston, J.E., King, P.J.B., Pooley, R.J. (eds) 7th UK Computer and Telecommunications Performance Engineering Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3538-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3538-8_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-19733-1
Online ISBN: 978-1-4471-3538-8
eBook Packages: Springer Book Archive