Analytic models for computer system performance analysis

  • Richard R. Muntz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8)


This paper is a survey of recent advances in the application of analytic modeling to computer system performance analysis. Emphasis is placed on multiple resource models and queueing network models in particular. A comparative survey of approaches to the analysis of queueing networks is presented. The application of these models to the study of fundamental concepts such as saturation and system balance is discussed. Published empirical studies evaluating the applicability of these models for quantitatively predicting system performance are described.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arora, S. R. and A. Gallo, The optimal organization of multiprogrammed multi-level memory, Proceedings of the Association of Computing Machinery Workshop on System Performance Evaluation, Harvard University (April 1971), 104–141.Google Scholar
  2. 2.
    Baskett, F., K. M. Chandy, R. R. Muntz, and F. G. Palacios, Open, closed and mixed networks of queues with different classes of customers, submitted to Journal of Association of Computing Machinery (1973).Google Scholar
  3. 3.
    Burke, P. J., Output processes and tandem queues, Proceedings of the Symposium on Computer-Communications, Networks, and Teletraffic, Polytechnic Institute of Brooklyn, New York (1972), 419–428.Google Scholar
  4. 4.
    Burke, P. J., The output of a queueing system, Oper. Res. 4 (1956), 699–704.Google Scholar
  5. 5.
    Buzen, J. P., Analysis of system bottlenecks using a queuing network model, Proceedings of ACM-SIGOPS Workshop on System Performance Evaluation (April 1971), 82–103.Google Scholar
  6. 6.
    Buzen, J. P., Computational algorithms for closed queueing networks with exponential servers, Comm. of the ACM, 16 (9) (September 1973), 527–531.Google Scholar
  7. 7.
    Chandy, K. M., The analysis and solutions for general queueing networks, Proceedings of the Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton University (March 1972).Google Scholar
  8. 8.
    Chandy, K. M., T. W. Keller, and J. C. Browne, Design automation and queueing networks: An interactive system for the evaluation of computer queueing models, Proceedings of the Design Automation Workshop, Dallas (June 1972).Google Scholar
  9. 9.
    Courtois, P. J., On the near-complete-decomposability of networks of queues and of stochastic models of multiprogramming computing systems, Ph.D. Thesis, Computer Science Department, Carnegie-Mellon University (November 1971).Google Scholar
  10. 10.
    Cox, D. R., A use of complex probabilities in the theory of stochastic processes, Proceedings Cambridge Philosophical Society 51 (1955), 313–319.Google Scholar
  11. 11.
    Ferdinand, A. E., A statistical mechanical approach to system analysis, IBM Journal of Research and Development 14 (5) (1970), 539–547.Google Scholar
  12. 12.
    Foley, J. D., An approach to the optimum design of computer graphics systems, Comm. of the ACM 14 (6) (June 1971), 380–390.Google Scholar
  13. 13.
    Gaver, D. P. and P. A. W. Lewis, Probability models for buffer storage allocation problems, Journal of the ACM 18 (2) (1971), 186–198.Google Scholar
  14. 14.
    Gaver, D. P. and G. S. Shedler, Multiprogramming system performance via diffusion approximations, IBM Research Report RJ-938 (November 1971).Google Scholar
  15. 15.
    Gaver, D. P., Analysis of remote terminal backlogs under heavy demand conditions, Journal of the ACM 18 (3) (1971), 405–415.Google Scholar
  16. 16.
    Gordon, W. J. and G. F. Newell, Cyclic queueing systems with restricted length queues, Oper. Res. 15 (1967), 266–277.Google Scholar
  17. 17.
    Gordon, W. J. and G. F. Newell, Closed queueing systems with exponential servers, Oper. Res. 15 (1967), 254–265.Google Scholar
  18. 18.
    Hughes, P. H. and G. Moe, A structural approach to computer performance analysis, Proc. National Computer Conference (1973), AFIPS Conference Proceedings Vol. 42, 109–120.Google Scholar
  19. 19.
    Irani, K. B. and V. L. Wallace, On network linguistics and the conversational design of queueing networks, Journal of the ACM 18 (4) (1971), 616–629.Google Scholar
  20. 20.
    Jackson, J. R., Networks of waiting lines, Oper. Res. 5 (1957), 518–521.Google Scholar
  21. 21.
    Jackson, J. R., Jobshop-like queueing systems, Management Science 10 (1) (1963), 131–142.Google Scholar
  22. 22.
    Kingman, J. F. C., Markov population processes, Journal of Applied Prob. 6 (1969), 1–18.Google Scholar
  23. 23.
    Kleinrock, L., Communication Nets, McGraw-Hill, New York (1964).Google Scholar
  24. 24.
    Kleinrock, L., Certain analytic results for time-shared processors, Proceedings of IFIPS 68, 838–845.Google Scholar
  25. 25.
    Kleinrock, L., A selected menu of analytical results for time-shared computer systems, Systempogrammierung, R. Oldenburg Verlag, Munich, Germany (1972), 45–73.Google Scholar
  26. 26.
    Kleinrock, L., Queueing Systems, Computer Applications, Vol. II, Wiley Interscience, New York (1974).Google Scholar
  27. 27.
    Kobayashi, H., Application of the diffusion approximation to queueing networks: Part I — Equilibrium queue distributions, Proceedings of the ACM SIGME Symposium on Measurement and Evaluation, Palo Alto (February 1973), 54–62 and also IBM Research Report RC 3943 (July 1972).Google Scholar
  28. 28.
    Kobayashi, H., Applications of the diffusion approximation to queueing networks: Part II — Transient queue distributions, IBM Research Report RC 4054 (September 1972).Google Scholar
  29. 29.
    Lassettre, E. R. and A. L. Scherr, Modeling the perofrmance of the OS/360 time-sharing option (TSO), Statistical Computer Performance Evaluation, Ed. W. Freiberger, Academic Press, New York (1972), 57–72.Google Scholar
  30. 30.
    McKinney, J. M., A survey of analytical time-sharing models, Computing Surveys 1 (2) (June 1967), 47–54.Google Scholar
  31. 31.
    Moore, C. G. III, Network models for large-scale time-sharing systems, Technical Report No. 71-1, Department of Industrial Engineering, University of Michigan, Ann Arbor, Michigan (April 1971).Google Scholar
  32. 32.
    Muntz, R. R., Poisson departure processes and queueing networks, IBM Research Report RC 4145 (December 1972) and Proc. of the Seventh Annual Princeton Conference on Information Sciences and Systems, Princeton University (Mar. 1973).Google Scholar
  33. 33.
    Muntz, R. R. and J. Wong, Efficient computational procedures for closed queueing networks with the product form solution, Modeling and Measurement Note No. 17, Computer Science Department, UCLA (June 1973).Google Scholar
  34. 34.
    Newell, G. F., Applications of Queuing Theory, Chapman and Hall, London (1971).Google Scholar
  35. 35.
    Reich, E., Waiting times when queues are in tandem, Ann. Math. Statist. 28 (1957), 768–773.Google Scholar
  36. 36.
    Sekino, A., Response time distribution of multiprogrammed time-shared computer systems, Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton University (March 1972), 613–619.Google Scholar
  37. 37.
    Sekino, A., Performance evaluation of multiprogrammed timed-shared computer systems, MIT Project MAC Report MAC-TR-103 (September 1972).Google Scholar
  38. 38.
    Sekino, A., Throughput analysis of multiprogrammed virtual-memory computer systems, First Annual SIGME Symposium on Measurement and Evaluation, Palo Alto, (February 1973), 47–53.Google Scholar
  39. 39.
    Wallace, V. L. and R. S. Rosenberg, RQA-1, the recursive queue analyzer, Technical Report 2, Systems Engineering Laboratory, Department of Electrical Engineering, University of Michigan, Ann Arbor, Michigan (February 1966).Google Scholar
  40. 40.
    Wallace, V. L., Toward an algebraic theory of markovian networks, Proceedings of the Symposium on Computer-Communications Networks and Teletraffic, Polytechnic Institute of Brooklyn, New York (1972), 397–408.Google Scholar
  41. 41.
    Whittle, P., Nonlinear migration processes, Proceedings of the 36th Session of the International Statistical Institute (1967).Google Scholar
  42. 42.
    Whittle, P., Equilibrium distributions for an open migration process, Journal of Applied Probability 5 (1968), 567–571.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Richard R. Muntz
    • 1
  1. 1.Computer Science DepartmentUniversity of CaliforniaLos Angeles

Personalised recommendations