This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analysis of Dynamic Locking with the No-Waiting Policy
July 1990 (vol. 16 no. 7)
pp. 684-698

A transaction processing system with two-phase dynamic locking with the no waiting policy (DLNW) for concurrency control is considered. In this method, transactions making conflicting lock requests are aborted and restarted rather than blocked, thereby eliminating blocking delays (and deadlocks), but making it susceptible to cyclic restarts. Cyclic restarts are dealt with by delaying the restart of a transaction encountering a lock conflict or replacing it with a new transaction. Analytic solution methods for evaluating the performance of the variants of the DLNW method are described. The analytic methods, validated against simulation and shown to be acceptably accurate, are used to study the effect of the following parameters on system performance: transaction size and its distribution, degree of concurrency, the throughput characteristic of the computer system, and the mixture of read-only query and update transactions. A comparison of the DLNW and dynamic locking with waiting (DLW) methods shows that DLW provides higher throughput than DLNW, except when there is no hardware resource contention and conflicted transactions can be replaced by new transactions. The DLNW method outperforms the time-stamp ordering method, as observed from simulation results as well as case by case analyses of possible scenarios.

[1] R. Agrawal, M. J. Carey, and M. Linvy, "Concurrency control performance modelling: Alternatives and implications,"ACM Trans. Database Syst., vol. 12, pp. 609-654, Dec. 1987.
[2] M. Carey, "Modeling and evalution of concurrency control algorithms," Ph.D. dissertation, Univ. California at Berkeley, 1983.
[3] 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.
[4] C. J. Date,An Introduction to Database Systems, vol. II. Reading, MA: Addison-Wesley, 1983.
[5] P. Franaszek and J. T. Robinson, "Limitations on concurrency in transaction processing,"ACM Trans. Database Systems, vol. 10, Mar. 1985.
[6] J. N. Gray, R. A. Lorie, G. R. Putzolu, and I. L. Traiger, "Granularity of locks and degrees of consistency in a shared database," inModeling in Database Management Systems, G. M. Nijssen, Ed. Amsterdam, The Netherlands: North-Holland, 1976, pp. 365-394.
[7] J. N. Gray, R. Homan, R. L. Obermarck, and H. Korth, "A strawman analysis of waiting and deadlock," IBM Res. Center, San Jose, CA, Rep. RJ 3066, Feb. 1981; Abstract appeared inProc. 5th Berkeley Workshop Distributed Data Management and Computer Networks. 1981, p. 125.
[8] L. Klkinrock,Queueing Systems, Vol. 1: Theory. New York: Wiley, 1975.
[9] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[10] S.S. Lavenberg,Computer Performance Modeling Handbook, Academic Press, New York, 1983.
[11] M. Reiser and S. S. Lavenberg, "Mean-value analysis of closed multichain queueing network models,"J. ACM, vol. 17, no. 2, pp. 213- 226, Apr. 1981.
[12] 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.
[13] I. K. Ryu, "Performance evaluation of concurrency control in data-base systems," Ph.D. dissertation, Dep. Elec. Eng.--Syst., Univ. Southern California, 1985.
[14] I. K. Ryu and A. Thomasian, "Analysis of database performance with dynamic locking," IBM, Yorktown Heights, NY, Res. Rep. RC 11428, Oct. 1985; alsoJ. ACM, to be published.
[15] A. Shum and P. G. Spirakis, "Performance analysis of concurrency control methods in database systems," inPerformance 81, F. Kylstra, Ed. Amsterdam, The Netherlands: North-Holland, 1981, pp. 1- 19.
[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] Y.C. Tay, N. Goodman, and R. Suri, "Locking performance in centralized databases,"ACM Trans. Database Syst., vol. 10, no. 4, pp. 415-462, Dec. 1985.
[18] Y. C. Tay,Locking Performance in Centralized Databases. Orlando, FL: Academic, 1987.
[19] 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.
[20] A. Thomasian and I. K. Ryu, "Analysis of some optimistic concurrency control schemes based on certification,"Perform. Eval. Rev., vol. 13, no. 2, pp. 192-203, 1985.

Index Terms:
performance analysis; dynamic locking; no-waiting policy; transaction processing system; concurrency control; blocking delays; deadlocks; cyclic restarts; throughput characteristic; read-only query; update transactions; time-stamp ordering method; concurrency control; performance evaluation; transaction processing.
Citation:
I.K. Ryu, A. Thomasian, "Performance Analysis of Dynamic Locking with the No-Waiting Policy," IEEE Transactions on Software Engineering, vol. 16, no. 7, pp. 684-698, July 1990, doi:10.1109/32.56095
Usage of this product signifies your acceptance of the Terms of Use.