Skip to main content
SpringerLink
Log in

Probabilistic models of computer systems

Part II: Diffusion approximations, waiting times and batch arrivals

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper we examine certain problems related to the use of diffusion approximations for the approximate modelling of computer systems. In particular we develop a model which allows us to handle waiting times and batch arrivals: these results are a new approach to the use of diffusion approximations. We also examine the effect of the distribution of holding times at boundaries: this question had remained open in earlier studies. We show that the stationary distributions associated with these diffusion models depend only on the average residence time of the process on the boundaries and not on the complete distribution function. This result justifies the use of exponential holding times as had been done in an earlier study.

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

Access this article

Log in via an institution

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. Gaver, D.P.: Diffusion approximations and models for certain congestion problems, J. Appl. Prob. 5, 607–623 (1968)

    Google Scholar 

  2. Newell, G.F.: Applications of queueing theory, London: Chapman and Hall 1971

    Google Scholar 

  3. Gaver, D.P., Shedler, G.S.: Processor utilization in multiprogramming systems via diffusion approximations, Operations Research 21, 569–576 (1963)

    Google Scholar 

  4. Kobayashi, H.: Application of the diffusion approximation to queueing networks: Part I — Equilibrium queue distributions, JACM 21, 2, 316–328 (1974)

    Google Scholar 

  5. Reiser, H., Kobayashi, H.: Accuracy of a diffusion approximation for some queueing networks, IBM J. Res. Dev. 18, 110–124 (1974)

    Google Scholar 

  6. Gelenbe, E.: On approximate computer system models, JACM 22, 261–269 (1975)

    Google Scholar 

  7. Feller, W.: Diffusion processes in one dimension, Trans. Am. Math. Soc., 77, 1–31 (1954)

    Google Scholar 

  8. Cox, D.R.: A use of complex probabilities in the theory of stochastic processes, Proc. Cambridge Philosophical Society, 51, 313–319 (1955)

    Google Scholar 

  9. Gelenbe, E., Muntz, R.R.: Probabilistic models of computer systems Part I (Exact results), Acta Informatica. 7, 35–60 (1976)

    Google Scholar 

  10. Gelenbe, E.: A diffusion model for drum input-output operations with general interarrivai distribution, unpublished note

  11. Cox, D.R.: Renewal Theory, Methuen and Co Ltd., Science Paperbacks (Methuen's Monographs on Applied Probability and Statistics), 1970

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, Université Paris-Sud, F-91405, Orsay, France

    Erol Gelenbe

Authors
  1. Erol Gelenbe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gelenbe, E. Probabilistic models of computer systems. Acta Informatica 12, 285–303 (1979). https://doi.org/10.1007/BF00268317

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation