Skip to main content
SpringerLink
Log in

Stability and queueing time analysis of a reader-writer queue with alternating exhaustive priorities

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper considers a reader-writer queue with alternating exhaustive priorities. The system can process an unlimited number of readers simultaneously. However, writers have to be processed one at a time. Both readers and writers arrive according to Poisson processes. Writer and reader service times are general iid random variables. There is infinite waiting room for both. The alternating exhaustive priority policy operates as follows. Assume the system is initially idle. The first arriving customer initiates service for the class (readers or writers) to which it belongs. Once processing begins for a given class of customers, this class is served exhaustively, i.e. until no members of that class are left in the system. At this point, if customers of the other class are in the queue, priority switches to this class, and it is served exhaustively. This system is analyzed to produce a stability condition and Laplace-Stieltjes transforms (LSTs) for the steady state queueing times of readers and writers. An example is also given.

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. F. Baccelli and E.G. Coffman Jr., A data base replication analysis using an M/M/m queue with service interruptions, SIGMETRICS Perform. Eval. Rev. 11(4) (1982–1983) 102–107.

    Google Scholar 

  2. F. Baccelli, C.A. Courcoubetis and M.I. Reiman, Construction of the stationary regime of queues with locking, Stoch. Processes and their Appl. 26 (1987) 257–265.

    Google Scholar 

  3. S. Browne and O. Kella, Parallel service with vacations, submitted to Oper. Res.

  4. S. Browne and J.M. Steele, Transient behavior of coverage processes with applications to the infinite-server queue, J. Appl. Prob. 30(3) (1993) 589.

    Google Scholar 

  5. E. Coffman Jr., E. Gelenbe and B. Platteau, Optimization of the number of copies in a distributed database, IEEE Trans. Software Eng. SE-7(1) (1981) 78–84.

    Google Scholar 

  6. E.G. Coffman, H.O. Pollak, E. Gelenbe and R.C. Wood, An analysis of parallel-read sequential-write systems, Perform. Eval. 1 (1981) 62–69.

    Google Scholar 

  7. C.A. Courcoubetis and M.I. Reiman, Optimal control of a queueing system with simultaneous service requirements, IEEE Trans. Autom. Control AC-32(8) (1987).

  8. C.A. Courcoubetis, M.I. Reiman and B. Simon, Stability of a queueing system with concurrent service and locking, SIAM J. Comput. 16(1) (1987) 169–178.

    Google Scholar 

  9. S.W. Fuhrmann, A note on the M/G/1 queue with server vacations, Oper. Res. 32(6) (1984).

  10. T. Johnson, Approximate analysis of reader and writer access to a shared resource,Proc. 1990 ACM Sigmetrics Conf. on Measurement and Modelling of Computer Systems, Boulder, CO, May 1990 (ACM Press, New York), pp. 106–114.

    Google Scholar 

  11. V.G. Kulkarni and L.C. Puryear, A reader-writer queue with reader preference, Queueing Systems 15 (1994) 81–97.

    Google Scholar 

  12. S.P. Meyn and R.L. Tweedie,Markov Chains and Stochastic Stability (Springer, 1993).

  13. D. Mitra, Probabilistic models and asymptotic results for concurrent processing with exclusive and non-exclusive locks, Soc. for Industrial and Appl. Math. SIAM J. Comput. 14(4) (1985) 1030–1051.

    Google Scholar 

  14. D. Mitra and P.J. Weinberger, Probabilistic models of database locking: Solutions, computational algorithms, and asymptotics, J. ACM 31(4) (1984) 855–878.

    Google Scholar 

  15. R. Nelson and B. Iyer, Analysis of a replicated database, Perform. Eval. 5(3) (1985) 133–148.

    Google Scholar 

  16. M.I. Reiman and P.E. Wright, Performance analysis of concurrent-read exclusive-write, Perform. Eval. Rev. 19(1) (1991) 168–177.

    Google Scholar 

  17. R.M. Ross,Stochastic Processes (Wiley, 1982).

  18. L. Takacs,Introduction to the Theory of Queues (Oxford University Press, 1962).

  19. Y.C. Tay, R. Suri and N. Goodman, A mean value performance model for locking in databases: The no waiting case, J. ACM 32(3) (1985) 618–651.

    Google Scholar 

  20. A. Thomasian and V.F. Nicola, Performance evaluation of a threshold policy for scheduling readers and writers, IEEE Trans. Comp. 42(2) (1993).

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, University of North Carolina, 27599, Chapel Hill, NC, USA

    V. G. Kulkarni

  2. IBM Corporation, Software Solutions, 27511, Cary, NC, USA

    L. C. Puryear

Authors
  1. V. G. Kulkarni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. C. Puryear
    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

Kulkarni, V.G., Puryear, L.C. Stability and queueing time analysis of a reader-writer queue with alternating exhaustive priorities. Queueing Syst 19, 81–103 (1995). https://doi.org/10.1007/BF01148941

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation