This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Recursive Solution Method to Analyze the Performance of Static Locking Systems
October 1989 (vol. 15 no. 10)
pp. 1147-1156

[1] M. M. Astrahanet al., "System R: Relational approach to database management,"Trans. Database Syst., vol. 1, no. 1, pp. 97-137, 1976.
[2] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[3] W. Cellary, E. Gelenbe, and T. Morzy,Concurrency Control in Distributed Database Systems. Amsterdam:North Holland, 1988.
[4] A. Chesnais, E. Gelenbe, and I. Mitrani, "On the modeling of parallel access to shared data,"Commum. ACM, vol. 26, no. 3., pp. 196-202, Mar. 1983.
[5] C. J. Date,A Guide to DB2. Reading, MA: Addison-Wesley, 1984.
[6] P. Franaszek and J. T. Robinson, "Limitations on concurrency in transaction processing,"ACM Trans. Database Systems, vol. 10, Mar. 1985.
[7] B. I. Galler and L. Bos, "A model of transaction blocking in databases,"Perform. Eval., vol. 3, pp. 95-122, May 1983.
[8] J. Gray, "The transaction concept: Virtues and limitations," inProc. Seventh Int. Conf. Very Large Data Bases, Cannes, France, Sept. 1981, pp. 144-154.
[9] L. Kleinrock,Queueing Systems, Vol. 1: Theory. New York: Wiley, 1975.
[10] A.M. Langer and A. W. Shum, "The distribution of granule accesses made by database transactions,"Commun. ACM, vol. 25, no. 11, pp. 831-832, Nov. 1982.
[11] S.S. Lavenberg,Computer Performance Modeling Handbook, Academic Press, New York, 1983.
[12] S. Lavenberg, "A simple analysis of exclusive and shared lock contention in a database system,"Perform. Eval. Rev., (Proc. 1984 ACM SIGMETRICS Conf., vol. 12, no. 3, pp. 143-148.
[13] D. Mitra and P. J. Weinberger, "Probabilistic models of database locking: Solutions, computational algorithms and asymptotics,"J. ACM, vol. 31, no. 4, pp. 855-878, Oct. 1984.
[14] D. Mitra, "Probabilistic models and asymptotic results for concurrent processing with exclusive and non-exclusive locks,"SIAM J. Comput., vol. 14, no. 4, pp. 1030-1051, Nov. 1985.
[15] R. J. T. Morris and W. S. Wong, "Performance of concurrency control algorithms with nonexclusive accesses," inPerformance '84: Proc. 10'th Int. Symp. Computer Performance, E. Gelenbe, Ed., Paris France, Dec. 1984, pp. 87-101.
[16] R. J. T. Morris and W. S. Wong, "Performance analysis of locking and optimistic concurrency control algorithms,"Perform. Eval., vol. 5, no. 2, pp. 105-118, 1985.
[17] D. Potier and P. Leblanc, "Analysis of locking policies in database management systems,"Commun. ACM, vol. 23, no. 10, pp. 584- 593, Oct. 1980.
[18] I. K. Ryu, "Performance evaluation of concurrency control in data-base systems," Dep. Elec. Eng. Syst., Univ. Southern California, 1985.
[19] Y. C. Tay, N. Goodman, and R. Suri, "Performance evaluation of locking in databases: A survey," Aiken Computation Laboratory, Harvard Univ., Tech. Rep. TR 17-84, Oct. 1984.
[20] Y. C. Tay,Locking Performance in Centralized Databases. Orlando, FL: Academic, 1987.
[21] A. Thomasian and I. K. Ryu, "A decomposition solution of the queueing network model the centralized DBMS with static locking," inProc. 1983 ACM SIGMETRICS Conf. Computer Performance Modeling, Measurement and Evaluation, Minneapolis, MN, Aug. 1983, pp. 82-92.
[22] A. Thomasian, "Performance evaluation of centralized databases with static locking,"IEEE Trans. Software Eng., vol. SE-11, no. 4, Apr. 1985.

Index Terms:
Concurrency control; database systems; performance evaluation; queueing networks
Citation:
A. Thomasian, In Kyung Ryu, "A Recursive Solution Method to Analyze the Performance of Static Locking Systems," IEEE Transactions on Software Engineering, vol. 15, no. 10, pp. 1147-1156, Oct. 1989, doi:10.1109/TSE.1989.559761
Usage of this product signifies your acceptance of the Terms of Use.