A reader-writer queue with reader preference

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 an M/G/• queue busy period to model readers, followed by a modified M/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.