Skip to main content
SpringerLink
Log in

Performance analysis of a constrained resource sharing system

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider a queueing system where the servers are arranged in a circle, and each arriving customer requires a pair of resources that is shared by its server with the respective neighbors on either side. If either resource is being used, the customer is denied service. Customers arrive at each server according to independent Poisson processes, and lengths of service times at each server have an exponential distribution. We derive a closed-form formula for the expected fraction of busy servers at any time in terms of the number of servers and the utilization factor (defined as the arrival rate times the mean service-time duration). This allows us to evaluate system performance when these parameters are varied, and to determine whether denying service to arrivals at alternate servers improves performance. We relate the system to Dijkstra's dining philosophers problem, which is an abstraction for resource sharing in an operating system.

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. M.J. Bach, The Design of the UNIX Operating System (Prentice-Hall, Englewood Cliffs, NJ, 1986).

    Google Scholar 

  2. E.W. Dijkstra, Hierarchical ordering of sequential processes, Acta Informatica 1 (1971) 115–138.

    Article  Google Scholar 

  3. W. Feller, An Introduction to Probability Theory and its Applications, 3rd ed. (Wiley, New York, NY, 1968).

    Google Scholar 

  4. W. Hart, College Algebra, 5th ed. (Heath, Boston, 1966).

    Google Scholar 

  5. L. Kleinrock, Queueing Systems, Vol. I (Wiley, New York, NY, 1975).

    Google Scholar 

  6. D. Knuth, The Art of Computer Programming, 2nd ed. (Addison-Wesley, Reading, MA, 1973).

    Google Scholar 

  7. M. Maekawa, A.E. Oldehoeft and R.R. Oldehoeft, Operating Systems (Benjamin/Cummings, Menlo Park, CA, 1987).

    Google Scholar 

  8. I. Mitrani, Modelling of Computer and Communication Systems (Cambridge Univ. Press, Cambridge, UK, 1987).

    Google Scholar 

  9. J.L. Peterson and A. Silberschatz, Operating System Concepts (Addison-Wesley, Reading, MA, 1985).

    Google Scholar 

  10. D.P. Reed and R.K. Kanodia, Synchronization with eventcounts and sequencers, Commun. ACM 22 (February 1979) 115–123.

Download references

Author information

Authors and Affiliations

  1. University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, MD, 21250, USA

    Deepinder P. Sidhu

  2. Department of Computer and Information Sciences, Towson State University, Towson, MD, 21252, USA

    Alexander L. Wijesinha

Authors
  1. Deepinder P. Sidhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander L. Wijesinha
    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

Sidhu, D.P., Wijesinha, A.L. Performance analysis of a constrained resource sharing system. Queueing Systems 29, 293–311 (1998). https://doi.org/10.1023/A:1019192316079

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019192316079

Search

Navigation