This Article 
 Bibliographic References 
 Add to: 
Performance Analysis of Static Locking in Distributed Database Systems
June 1990 (vol. 39 no. 6)
pp. 741-751

A queueing model is used to approximate static locking in distributed database systems without deadlocks. Then a random graph model to find the deadlock probability of each transaction is proposed. Finally, the above two models are integrated, so that given the transaction arrival rate, the response time and the effective throughput can be calculated.

[1] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[2] M. Carey, "Modeling and evalution of concurrency control algorithms," Ph.D. dissertation, Univ. California at Berkeley, 1983.
[3] M. S. Chen, "Shortest paths in communication networks," inProc. IEEE Global Telecommun. Conf., Houston, TX, Dec. 1986, pp. 1251-1257.
[4] J. Gray, P. Homan, H. Korth, and R. Obermarck, "A straw man analysis of the probability of waiting and deadlock in a database system," inProc. 5th Berkeley Workshop Distributed Data Management Comput. Networks, Feb. 1981, p. 125.
[5] A. Hac, "A decomposition solution to a queueing network model of a distributed file system with dynamic locking,"IEEE Trans. Software Eng., vol. SE-12, no. 4, pp. 521-530, Apr. 1986.
[6] P. F. King and A. J. Collmeyer, "Database sharing--An efficient mechanism for supporting concurrent processes," inProc. 1974 Nat. Commun. Conf., Montvale, NJ, 1974.
[7] L. Kleinrock,Queueing Systems, Vol. I. New York: Wiley-Interscience, 1975.
[8] V. O. K. Li, "Conflict models of two-phase locking algorithms in distributed databases," inProc. 6th IEEE COMPSAC, Dec. 1982, pp. 368-376.
[9] 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.
[10] T. Nakanishi and D. A. Menasce, "Correctness and performance evaluation of a two-phase commit-based protocol for DDBs,"Comput. Perform., vol. 5, no. 1, pp. 38-54, Mar. 1984.
[11] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[12] D. Potier and P. Leblanc, "Analysis of locking policies in database management systems,"Commun. ACM, vol. 23, no. 10, pp. 584- 593, Oct. 1980.
[13] D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis, II, "System level concurrency control for distributed database systems,"ACM Trans. Database Syst., vol. 3, pp. 178-198, June 1978.
[14] K. C. Sevcik, "Comparison of concurrency control method using analycal models," inProc. IFIP 9th World Comput. Congress, Paris, France, Sept. 1983, pp. 847-858.
[15] Y. Tay and R. Suri, "Choice and performance in locking for databases," inProc. 10th VLDB Conf., Sept. 1984.
[16] Y. C. Tay, R. Suri, and N. Goodman, "A mean value performance model for locking in databases: the no-waiting case,"J. ACM, vol. 32, no. 3, pp. 618-651, July 1985.
[17] A. Thomasian, "An iterative solution to the queueing network model of a dbms with dynamic locking," inProc. 13th Comput. Measurement Group Conf., Dec. 1982, pp. 252-261.
[18] 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.

Index Terms:
performance analysis; static locking; distributed database systems; queueing model; random graph model; response time; distributed databases; performance evaluation; queueing theory.
S.-C. Shyu, V.O.K. Li, "Performance Analysis of Static Locking in Distributed Database Systems," IEEE Transactions on Computers, vol. 39, no. 6, pp. 741-751, June 1990, doi:10.1109/12.53595
Usage of this product signifies your acceptance of the Terms of Use.