Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

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

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 to check access.

References

  1. [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.

  2. [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.

  3. [3]

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

  4. [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.

  5. [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.

  6. [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.

  7. [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. [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.

  9. [9]

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

  10. [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.

  11. [11]

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

  12. [12]

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

  13. [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.

  14. [14]

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

  15. [15]

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

  16. [16]

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

  17. [17]

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

  18. [18]

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

  19. [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.

  20. [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

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

Keywords

  • Reader-writer queue
  • alternating priority
  • M/G/1 queue
  • M/G/∞ queue
  • semi-Markov process
  • concurrency control
  • locking