Skip to main content
Log in

Fundamental operational laws of computer system performance

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A number of laws are derived which establish relationships between throughput, response time, device utilization, space-time products and various other factors related to computer system performance. These laws are obtained through the operational method of computer system analysis. The operational method, which is formally introduced in this paper, differs significantly from the conventional stochastic modeling approach and is based on a set of concepts that correspond naturally and directly to observed properties of real computer systems. The operational laws presented in this paper apply with complete precision to all collections of observational data, and they are similar to fundamental laws found in other areas of engineering and applied science.

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.

Similar content being viewed by others

References

  1. Boyse, J. W., Warn, D. R.: A straightforward model for computer performance prediction. Computing Surveys 7, 73–93 (1975)

    Google Scholar 

  2. Buzen, J. P.: Analysis of system bottlenecks using a queueing network model. Proc. ACM SIGOPS Workshop on Syst. Perf. Eval., April 1971, Cambridge (Mass.) p. 82–103

  3. Buzen, J. P.: I/0 subsystem architecture. Proc. IEEE 63, 871–379 (1975)

    Google Scholar 

  4. Buzen, J. P.: Cost-effective analytic tools for computer performance evaluation. Proc. COMPCON 75-IEEE Computer Society Conference, Sept. 1975, p. 293–296

  5. Buzen, J. P.: Fundamental laws of computer system performance. Proc. ACM-IFIP International Symp. on Computer Performance Modeling, Measurement and Evaluation, March 1976, p. 200–210

  6. Chang, A., Lavenburg, S. S.: Work rates in closed queueing networks with general independent servers. Operations Research 22, 838–847 (1974)

    Google Scholar 

  7. Feller, W.: An introduction to probability theory and its applications, Vol. II. New York: Wiley 1966

    Google Scholar 

  8. Jewell, W. S.: A simple proof of: L=λW. Operations Research 15, 1109–1116 (1967)

    Google Scholar 

  9. Little, J. D. C.: A proof of the queueing formula L=λW. Operations Research 9, 383–387 (1961)

    Google Scholar 

  10. Maxwell, W. L.: On the generality of the equation L=λW. Operations Research 18, 172–174 (1970)

    Google Scholar 

  11. Kleinrock, L.: Certain analytic results for time shared processors. Proc. IFIP Congress 1968, Amsterdam: North-Holland 1968, p. 838–845

    Google Scholar 

  12. Moore, C.: Network models for large scale time sharing systems. Dept. Industrial Eng., Univ. of Michigan, Ann Arbor TR-71-1, April 1971

    Google Scholar 

  13. Muntz, R. R., Wong, J.: Asymptotic properties of closed queueing network models. Proc. Eighth Annual Princeton Conference on Information Sciences and Systems, March 1974, p. 348–353

  14. Scherr, A.: An analysis of time shared computer systems. Cambridge (Mass.): M.I.T. Press 1967

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

A preliminary version of this paper was published in the Proceedings of the IFIP/ACM SIGMETRICS International Symposium on Computer Performance Modeling, Measurement and Evaluation, Cambridge (Mass.) March 1976, p. 200–210

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buzen, J.P. Fundamental operational laws of computer system performance. Acta Informatica 7, 167–182 (1976). https://doi.org/10.1007/BF00265769

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation