Issue No.03 - March (1995 vol.21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.372148
We analyze the performance of queues that serve readers and writers. Readers are served concurrently, while writers require exclusive service. We approximately analyze a first-come-first-serve (FCFS) reader/writer queue, and derive simple formulae for computing waiting times and capacity under the assumption of Poisson arrivals and exponential service. We extend the analysis to handle a one-writer queue, and a queue that includes write-intention locks. The simple analyses that we present can be used as rules-of-thumb for designing concurrent systems.
Performance analysis, queuing system, concurrent system, reader/writer, lock queue
Theodore Johnson, "Approximate Analysis of Reader/Writer Queues", IEEE Transactions on Software Engineering, vol.21, no. 3, pp. 209-218, March 1995, doi:10.1109/32.372148