This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Performance Comparison of Locking Methods with Limited Wait Depth
May-June 1997 (vol. 9 no. 3)
pp. 421-434

Abstract—A number of recent studies have proposed lock conflict resolution methods to improve the performance of standard locking, i.e., strict two-phase locking with the general waiting method. This paper is primarily concerned with the performance of wait depth limited methods with respect to each other and some other methods. The methods considered include the general waiting, wound-wait, and no-waiting methods, symmetric and asymmetric versions of cautious waiting and running priority methods, the wait depth limited (WDL) method, and a modified version of it. In spite of the availability of analytic solutions for most of wait depth limited methods, for reasons given in the paper, the performance comparison is based on simulation results. The contributions of this study are as follows: 1) modeling assumptions, i.e., a careful definition of transaction restart options; 2) new results concerning the relative performance of wait depth limited methods, which show that a) the running priority method outperforms cautious waiting and may even outperform the WDL method in a system with limited hardware resource, b) WDL outperforms other methods in high lock contention, high capacity systems, and c) modified WDL has a performance comparable to WDL, but incurs less overhead in selecting the abort victim; and 3) contrary to common belief, Tay's Effective Database Size Paradigm for dealing with shared and exclusive locks and/or skewed database accesses in standard locking is applicable to some wait depth limited methods and provides acceptably accurate approximations in others—as long as locking modes for restarted transactions are not resampled.

[1] D. Agrawal, A. El Abbadi, and A.E. Lang, The Performance of Protocols Based on Locks with Ordered Sharing IEEE Trans. Knowledge and Data Eng., vol. 6, no. 5, pp. 805-818, Oct. 1994.
[2] R. Agrawal, M.J. Carey, and L.W. McVoy, "The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems," IEEE Trans. Software Eng., vol. 13, no. 12, pp. 1,348-1,363, Dec. 1987.
[3] R. Agrawal, M.J. Carey, and M. Livny, "Concurrency Control Performance Modeling: Alternatives and Implications," ACM Trans. Database Systems, vol. 12, no. 4, pp. 609-654, Dec. 1987.
[4] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[5] 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.
[6] E.G. Coffman and P.J. Denning,Operating Systems Theory, Prentice-Hall Inc., Englewood Cliffs, N.J., 1973.
[7] P.A. Franaszek and J.T. Robinson, "Limitations of Concurrency in Transaction Processing," ACM Trans. Database Systems, vol. 10, no. 1, pp. 1-28, Mar. 1985.
[8] P.A. Franaszek, J.T. Robinson, and A. Thomasian, "Adaptive Concurrency Control Scheme for Transaction Processing," IBM Technical Disclosure Bull., vol. 33, no. 9, pp. 29-30, Feb. 1991.
[9] P.A. Franaszek, J.T. Robinson, and A. Thomasian, "Concurrency Control for High Contention Environments," ACM Trans. Database Systems, vol. 17, no. 2, pp. 304-345, June 1992.
[10] P.A. Franaszek, J.R. Haritsa, J.T. Robinson, and A. Thomasian, "Distributed Concurrency Control Based on Limited Wait Depth," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 6, pp. 246-264, Nov. 1993.
[11] J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kauffman, 1993.
[12] M. Hsu and B. Zhang, "Performance Evaluation of Cautious Waiting," ACM Trans. Database Systems, vol. 17, no. 3, pp. 477-512, Sept. 1992.
[13] M. Hsu and B. Zhang, "Modeling Performance Impact of Hot Spots," chapter 7 in Performance of Concurrency Control Mechanisms in Centralized Databases Systems, V. Kumar, ed., Englewood Cliffs, N.J.: Prentice Hall, pp. 148-164, 1995.
[14] L. Kleinrock, Queueing Systems, Vol. I: Theory.New York: John Wiley and Sons, 1975.
[15] C. Mohan, "Interaction Between Query Optimization and Concurrency Control," Proc. Second Int'l Workshop Research Issues on Data Eng.,Tempe, Ariz., pp. 26-35, Feb. 1992.
[16] T. Ohmori, M. Kitsuregawa, and H. Tanaka, "Concurrency Control of Bulk Access Transactions on Shared Nothing Parallel Database Machines," Proc. Sixth Int'l Conf. Data Eng.,Los Angeles, pp. 476-485, Feb. 1990.
[17] D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis II, "System Level Concurrency Control for Distributed Database Systems," ACM Trans. Database Systems, vol. 3, no. 2, pp. 178-198, June 1978.
[18] I.K. Ryu and A. Thomasian,“Performance analysis of centralized database with optimistic concurrency control,” Performance Evaluation, vol. 7, pp. 195-211, 1987.
[19] I.K. Ryu and A. Thomasian,“Analysis of database performance with dynamic locking,” J. ACM, vol. 37, no. 3, pp. 491-523, 1990.
[20] I.K. Ryu and A. Thomasian, “Performance Analysis of Dynamic Locking with the No-Waiting Policy,” IEEE Trans. Software Eng., vol. 16, no. 7, July 1990.
[21] K. Salem, H. Garcia-Molina, and J. Shands, "Altruistic Locking," ACM Trans. Database Systems, vol. 19, no.1, pp. 117-165, Mar. 1994.
[22] V. Singhal and A.J. Smith, "Characterization of Contention in Real Relational Databases," Tech. Report UCB/CSD 94/801, Computer Science Div., Univ. of California at Berkeley, Mar. 1994.
[23] M. Singhal and Y. Yesha, "A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database Under Arbitrary Data Access Distribution," Information Processing Letters 27, pp. 69-74, 1988.
[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] Y. Tay, R. Suri, and N. Goodman, "A Mean Value Performance Model for Locking in Databases: The No-Waiting Case," J. ACM, vol. 32, pp. 618-651, July 1985.
[26] Y.C. Tay, Locking Performance in Centralized Databases.Orlando, Fla.: Academic Press, 1987.
[27] A. Thomasian, "Performance Analysis of Locking Methods with Limited Wait Depth," Proc. ACM SIGMETRICS Conf. Measurement and Modeling Computer Systems and Performance,Newport, R.I., pp. 115-127, June 1992.
[28] A. Thomasian, "Two-Phase Locking Performance and Its Thrashing Behavior," ACM Trans. Database Systems, vol. 18, no. 3, Sept. 1993.
[29] A. Thomasian, "A More Realistic Locking Model and Its Analysis," Information Systems, vol. 21, no. 5, pp. 409-430, 1996.
[30] A. Thomasian, "Checkpointing for Optimistic Concurrency Control Methods," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 2, pp. 332-339, Apr. 1995.
[31] A. Thomasian and V.F. Nicola, "Performance Evaluation of a Threshold Method for Scheduling Readers and Writers," IEEE Trans. Computers, vol. 42, no. 1, pp. 83-98, Jan. 1993.
[32] A. Thomasian and I.K. Ryu, "Performance Analysis of Two-Phase Locking," IEEE Trans. Software Eng., vol. 17, no. 5, pp. 386-402, Sept. 1991.

Index Terms:
Transaction processing, concurrency control, data contention, two-phase locking, load control, running priority method, wait depth limited method, cautious waiting method, wound wait method, no-waiting method, performance modeling and analysis, simulation.
Citation:
Alexander Thomasian, "A Performance Comparison of Locking Methods with Limited Wait Depth," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 3, pp. 421-434, May-June 1997, doi:10.1109/69.599931
Usage of this product signifies your acceptance of the Terms of Use.