Paper Info
Title
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.
Year
DOI
Venue
1995
10.1007/BF01148941
Queueing Syst.
Keywords
Field
DocType
Reader-writer queue,alternating priority,M/G,/1 queue,M/G,/∞ queue,semi-Markov process,concurrency control,locking
Random variable,Concurrency control,Computer science,Idle,Queue,Reader writer,M/G/1 queue,Real-time computing,Queueing theory,Poisson distribution
Journal
Volume
Issue
ISSN
19
1-2
0257-0130
Citations 
PageRank 
References 
2
0.39
13
Authors
2
Name
Order
Citations
PageRank
Vidyadhar G. Kulkarni153960.15
Lindsey C. Puryear270.96