This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Approximate Analysis of Reader/Writer Queues
March 1995 (vol. 21 no. 3)
pp. 209-218
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.

[1] F. Baccelli, C. A. Courcoubetis, and M. I. Reiman,“Construction of the stationary regime of queues with locking,”Stochast. Processes and their Appl., vol. 26, pp. 257–265, 1987.
[2] 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., vol. 11, no. 4, pp. 102–107, 1982–1983.
[3] R. Bayer and M. Schkolnick,“Concurrency of operations on$B$-trees,”Acta Informatica, vol. 9, pp. 1–21, 1977.
[4] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[5] T. J. Bromwich,An Introduction to the Theory of Infinite Series. New York: MacMillian, 1926.
[6] A. Chesnais, E. Gelenbe, and I. Mitrani, "On the Modeling of Parallel Access to Shared Data," Comm. ACM, vol. 26, no. 3, pp. 196-202, Mar. 1983.
[7] E. Coffmanet al.,“An analysis of parallel-read sequential-write systems,”Perform. Eval., vol. 1, pp. 62–69, 1981.
[8] E. Coffman, E. Gelenbe, and B. Plateau,“Optimization of the number of copies in a distributed database,”IEEE Trans. Software Eng., vol. 7, pp. 78–84, 1981.
[9] C. A. Courcoubetis and M. I. Reiman,“Optimal control of a queuing system with simultaneous service requirements,”IEEE Trans. Automat. Contr., vol. 32, pp. 717–727, 1987.
[10] C. A. Courcoubetis, M. I. Reiman, and B. Simon,“Stability of a queuing system with concurrent service and locking,”SIAM J. Comput., vol. 16, no. 1, pp. 169–178, 1987.
[11] T. Johnson,“Approximate analysis of reader and writer access to a shared resource,” ACM SIGMETRICS Conf. Measuring and Modeling Computer Systems, pp. 106-114, 1990
[12] ——,“The performance of concurrent data structure algorithms,”Ph.D. dissertation, Dep. of Comput. Sci., New York Univ., 1990.
[13] E.R. Hancock and J. Kittler, "A Bayesian Interpretation for the Hopfield Network," 1993 IEEE Int'l Conf. Neural Networks, pp. 341-346, 1993.
[14] L. Kleinrock,Queueing System. New York: Wiley, 1975, vol. 1.
[15] C. G. Van Der Laan, and N. M. Temme,Calculation of Special Functions: The Gamma Function, the Exponential Integral and Error-like Functions. Cenrtum foor Wiskunde en Informatica, 1984.
[16] I. Heavens,“Experiences in fine grain parallelisation of streams-based communications drivers,”inOpen Forum'92, Spider Syst. Ltd., Utrecht, Nov. 1992.
[17] R. Mickens,Difference Equations. New York: Van Nostrand Reinhold, 1987.
[18] D. Mitra and P.J. Weinberger, "Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics," J. ACM, vol. 31, pp. 855-878, Oct. 1984.
[19] R.D. Nelson and B.R. Iyer, “Analysis of a Replicated Database,” Performance Evaluation, vol. 5, pp. 133-148, 1985.
[20] M. I. Reiman and P. E. Wright,“The stability and latency of concurrent-$x$exclusive-$y$,”submitted to theJ. ACM.
[21] M.I. Reiman and P.E. Wright,“Performance analysis of concurrent-read exclusive-write,” Proc. ACM Sigmetrics Conf. Measuring and Modeling of COmupter SYstems, pp. 168-177, 1991.
[22] J. Riordan,Combinatorial Identities. Huntington, NY: Kreiger, 1979.
[23] G. Simmons,Differential Equations with Applications and Historical Notes. New York: McGraw-Hill, 1972.
[24] Y.C. Tay,R. Suri,, and N. Goodman,“Locking performance in centralized databases,” ACM Trans. Database Systems, vol. 10, no. 4, pp. 415-462, 1985.
[25] A. Thomasian and V. Nicola,“Analysis of a threshold policy for scheduling readers and writers,”IBM Res. Div., Tech. Rep. RC 14252, 1988.
[26] ——,“Analysis of a threshold policy for scheduling readers and writers,”inACM SIGMETRICS Conf. Measuring Model. Comput. Syst., 1989.
[27] ——,“Performance evaluation of a threshold policy for scheduling readers and writers,”IBM Res. Div., Tech. Rep. RC 14878, 1989, to appear inIEEE Trans. Comput..

Index Terms:
Performance analysis, queuing system, concurrent system, reader/writer, lock queue
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.