ISSN:
1572-9443
Keywords:
reader-writer queue
;
reader preference
;
M/G/1 queue with exceptional service
;
M/G/∞ queue
;
concurrency control
;
locking
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract This paper considers a reader-writer queue with reader preference. The system can process an unlimited number of readers simultaneously. However, writers have to be processed one at a time. Readers are given non-preemptive priority over writers. Both readers and writers arrive according to Poisson processes (PP) and have general independent service times. There is infinite waiting room for both. This system is analyzed to produce stability conditions. The analysis uses anM/G/∞ queue busy period to model readers, followed by a modifiedM/G/1 queue to model the entire system. Finally, results are presented for the expected wait-in-queue times for the readers and writers. The paper ends with an example.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01189233
Permalink
