Skip to main content
Log in

Validation of a computer performance model of the exponential queuing network family

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The applicability and accuracy of a general queuing network approach to the modeling of computer performance was tested in an actual production environment. The validation exercise established that such an approach had both sufficient flexibility and precision to be of use in long range planning efforts. The accuracy of the results further suggests that these techniques may be successfully extended to a wide range of uses.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Avi-Itehak, B., Heyman, D. P.: Approximate queuing models for multiprogramming computer systems. J. ORSA 21, 1212–1230 (1973)

    Google Scholar 

  2. Baskett, F., Chandy, K. M., Muntz, R., Palacios, F.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22, 248–260 (1975)

    Google Scholar 

  3. Bhandiwad, R. A., Williams, A. C.: Queuing network models of computer systems. Proceedings of the 3rd Texas Conference on Computing Systems, November 1974

  4. Buzen, J. P.: Computational algorithms for closed queuing networks with exponential servers. Comm. ACM 16, 527–531 (1973)

    Google Scholar 

  5. Buzen, J. P.: Queuing network models of multiprogramming. Division of Engineering and Physics Harvard U., Ph. D. Thesis, 1971

  6. Chandy, K. M., Herzog, U., Woo, L.: Parametric analysis of queuing networks. IBM J. R and D 19, 36–42 (1975)

    Google Scholar 

  7. Chandy, K. M., Herzog, U., Woo, L.: Approximate analysis of general queuing networks. IBM. J. R and D 19, 43–49 (1975)

    Google Scholar 

  8. Chandy, K. M., Sauer, C. H.: Approximate analysis of central server models. IBM J. R and D 19, 301–313 (1975)

    Google Scholar 

  9. Gaver, D. P.: Probability models for multiprogramming computer systems. J. ACM 14, 423–438 (1967)

    Google Scholar 

  10. Giammo, T. P.: Extensions to exponential queuing network theory for use in a planning environment. Procedings of the IEEE Fall '76 Compcon Cenforence, Washington D. C., 1976

  11. Gordon, W. J., Newell, G. G.: Closed queuing systems with exponential servers. J. ORSA 15, 254–265 (1967)

    Google Scholar 

  12. Hanssman, F., Kistler, W., Schulz, H.: Modeling for computer center planning. IBM Systems J. 3, 305–324 (1971)

    Google Scholar 

  13. Kimbleton, S. R., Moore, G. A.: A limited resource approach to system performance evaluation. ISDOS Research Report 71-2, University of Michigan, June 1971

  14. Kobayashi, H., Reiser, M.: Queuing networks with multiple closed chains: Theory and computational algorithms. IBM J. R and D 19, 283–294 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giammo, T. Validation of a computer performance model of the exponential queuing network family. Acta Informatica 7, 137–152 (1976). https://doi.org/10.1007/BF00265767

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00265767

Keywords

Navigation