Skip to main content

Advertisement

Springer Nature Link
Log in

Performance analysis of a scheme for concurrency/synchronization using queueing network models

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

Queueing network models have been used extensively to analyze performance of computer systems. However, queueing network models with product form solutions are not directly applicable to systems that process programs with internal concurrency/synchronization. An exact solution of such systems is often not feasible because of its large state space.

Approximation techniques, based on queueing network theory, are presented which analyze the performance of closed systems with a specific scheme of concurrency/synchronization. The techniques are applicable to multitasking systems, distributed database systems, packet routing environments, and fork/join situations.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. F. Baskett, K. Chandy, R. Muntz, and F. Palacios, Open, closed, and mixed networks of queues with different classes of customers.J. of ACM, Vol. 22, No. 2 (April 1975).

  2. K. Chandy and A. Martin, A characterization of product-form queueing networks, J. of ACM, Vol. 30, No. 2 (April 1983).

  3. D. Towsley, K. Chandy, and J. Browne, Models for parallel processing within programs: application to CPU:I/O, and I/O:I/O overlap,Comm. of ACM, Vol. 21, No. 10 (October 1978).

  4. P. Heidelberg and K. Trivedi, Queueing network models for parallel processing with asynchronous tasks,IEEE TC, Vol. C-31, No. 11 (November 1982).

  5. P. Heidelberger and K. Trivedi, Analytic queueing models for programs with internal concurrency,IEEE TC, Vol. C-32, No. 1 (January 1983).

  6. A. Thomasian and P. Bay, Queueing network models for parallel processing of task systems,Proc. of the Intl. Conference Parallel Processing IEEE (1983).

  7. F. Baccelli and A. Makowski, Simple computable bounds for the fork/join queue,TR 394 INRIA (April 1985).

  8. D. Eager, J. Zahorjan, and E. Lazowska, Speedup versus efficiency in parallel system, University of Washington, TR CS-86-08-01 (August 1986).

  9. G. Andrews and F. Schneider. Concepts and notation for concurrent programming,Computing Surveys, Vol. 15, No. 1 (March 1983).

  10. C. Sauer, E. MacNair, and J. Kurose, The research queueing package: past, present and future,Proc. National Computer Conference, AFIPS (1982).

  11. W. Myers, Getting the cycles of a supercomputer,Computer, Vol. 19, No. 3 (March 1986).

  12. J. Larson, Multitasking on the Cray X-MP-2 processors,Computer, Vol. 17, No. 7 (July 1984).

  13. B. Kernighan and R. Pike,The Unix Programming Environment, Prentice Hall (1984).

  14. P. Bernstein and N. Goodman, Concurrent control in distributed database systems, Computing Surveys, Vol. 13, No. 2 (1983).

  15. A. Tanenbaum,Computer Networks, Prentice Hall (1981).

  16. L. Dowdy and M. Chopra, On the applicability of using multiprogramming level distribution,Proc. of ACM Sigmetrics Conference, Texas (August 1985).

  17. J. Little, A proof of the queueing formulaL=λW, Oper. Res. 9:383–387 (1961).

    Google Scholar 

  18. E. Lazowska, J. Lahorjan, G. Graham, and K. Sevcik,Quantitative Systems Performance, Prentice Hall (1984).

  19. M. Reiser and S. Lavenberg, Mean value analysis of closed multichain queueing networks,J. of ACM, Vol. 29, No. 2 (April 1980).

  20. J. Buzen, Computational algorithms for closed queueing networks with exponential servers,Comm. of ACM, Vol. 16, No. 9 (September 1979).

  21. K. Trivedi,Probability and Statistics with Reliability, Queueing and Computer Science Application, Prentice Hall (1982).

  22. S. Lavenberg and M. Reiser, Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers,J. Appl. Prob. Vol. 17 (December 1980).

  23. C. Sauer and K. Chandy, The impact of distributions and disciplines on multiple processor systems,Comm. of ACM, Vol. 21, No. 1 (January 1979).

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Vanderbilt University, Station B, P.O. 1679, 37235, Nashville, TN

    Virgilio A. F. Almeida & Lawrence W. Dowdy

Authors
  1. Virgilio A. F. Almeida
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Lawrence W. Dowdy
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This research was partially supported by CNPq/Brazil, Hospital Corporation of America (HCA) and Northern Telecom.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Almeida, V.A.F., Dowdy, L.W. Performance analysis of a scheme for concurrency/synchronization using queueing network models. Int J Parallel Prog 15, 529–550 (1986). https://doi.org/10.1007/BF01407412

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words