This Article 
 Bibliographic References 
 Add to: 
Performance Analysis of Concurrency Control Using Locking with Deferred Blocking
October 1993 (vol. 19 no. 10)
pp. 982-996

The concurrency control (CC) method employed can be critical to the performance of transaction processing systems. Conventional locking suffers from the blocking phenomenon, where waiting transactions continue to hold locks and block other transactions from progressing. In a high data contention environment, as an increasing number of transactions wait, a larger number of lock requests get blocked and fewer lock requests can get through. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. By properly balancing the blocking and abort effects, the proposed scheme can lead to better performance than either the conventional locking or the optimistic concurrency control (OCC) schemes at all data and resource contention levels. We consider both static and dynamic approaches to determine when to switch from the nonblocking phase to the blocking phase. An analytical model is developed to estimate the performance of this scheme and determine the optimal operating or switching point. The accuracy of the analytic model is validated through a detailed simulation.

[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] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[3] M.J. Carey and M. Livny, "Conflict detection trade-offs for replicated data,"ACM Trans. Database Syst., vol. 16, pp. 703-746, Dec. 1991.
[4] W. Cellary, E. Gelenbe, and T. Morzy,Concurrency Control in Distributed Database Systems. Amsterdam:North Holland, 1988.
[5] 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.
[6] B. Ciciani, D. M. Dias, and P. S. Yu, "Analysis of replication in distributed database systems,"IEEE Trans. Knowledge Data Eng., vol. 2, no. 2, pp. 247-261, June 1990.
[7] B. Ciciani, D. M. Dias, B. R. Iyer, and P. S. Yu, "A hybrid distributed centralized system structure for transaction processing,"IEEE Trans. Software Eng., vol. 16, no. 8, pp. 791-806, Aug. 1990.
[8] B. Ciciani, D. M. Dias, and P. S. Yu, "Analysis of concurrency-coherency control protocols for distributed transaction processing systems with regional locality,"IEEE Trans. Software Eng., vol. 18, no. 10, pp. 899-914, Oct. 1992.
[9] E. G. Coffman, E. Gelenbe, and B. Plateau, "Optimization of the number of copies in a distributed system,"IEEE Trans. Software Eng., vol. SE-7, no. 1, pp. 78-84, Jan. 1981.
[10] A. Dan, D. F. Towsley, and W. H. Kohler, "Modeling the effects of data and resource contention on the performance of optimistic concurrency control protocols," inProc. 4th Int. Conf. on Data Eng.(Los Angeles, CA), Feb. 1988, pp. 418-425.
[11] A. Dan, D. M. Dias, and P.S. Yu, "Database buffer model for the data sharing environment," inProc. 6th Int. Conf. on Data Eng.(Los Angeles, CA), Feb. 1990, pp. 538-544.
[12] A. Dan, D. M. Dias, and P. S. Yu, "The effect of skewed data access on buffer hits and data contention in a data sharing environment," inProc. 16th Int. Conf. Very Large Data Bases, Brisbane, Australia, Aug. 1990, pp. 419-431.
[13] A. Dan, and P. S. Yu, "Performance analysis of buffer coherency policies in a multisystem data sharing environment,"IEEE Trans. Parallel Distributed Syst., vol. 4, no. 3, pp. 289-305, Mar. 1993.
[14] C. J. Date,An Introduction to Database Systems, vol. 2. Reading, MA: Addison Wesley, 1983.
[15] D. M. Dias, B. R. Iyer, and P. S. Yu, "Trade-offs between coupling small and large processors for transaction processing,"IEEE Trans. Comput., vol. 37, no. 3, pp. 310-320, Mar. 1988.
[16] P. Franaszek and J. T. Robinson, "Limitations on concurrency in transaction processing,"ACM Trans. Database Systems, vol. 10, Mar. 1985.
[17] P. A. Franazsek, J. T. Robinson, and A. Thomasian, "Concurrency control for high contention environments,"ACM Trans. Database Syst., vol. 17, pp. 304-345, June 1992.
[18] B. I. Galler, "Concurrency control performance issues," Ph.D. thesis, Comput. Sci. Dept., Univ. Toronto, Sept. 1982.
[19] B. I. Galler and L. Bos, "A model of transaction blocking in databases,"Performance Eval., vol. 3, pp. 95-122, 1983.
[20] J. Gray, P. Homan, R. Obermarck, and H. Korth, "A straw man analysis of probability of waiting and deadlock," IBM Res. Rep. RJ 3066, San Jose, CA, 1981.
[21] J. Gray, Ed.,The Benchmark Handbook for Database and Transaction Processing Systems. San Mateo, CA: Morgan Kaufmann, 1991.
[22] C. S. Hartzman, "The delay due to dynamic two-phase locking,"IEEE Trans. Software Eng., vol. 15, no. 1, pp. 72-82, Jan. 1989.
[23] M. Hsu and B. Shang, "Modeling performance impact of hotspots," Aiken Computation Lab., Harvard Univ., Cambridge, MA, Tech. Rep. TR-08-88, Apr. 1988.
[24] K. B. Irani and H. L. Lin, "Queueing network models for concurrent transaction processing in a database system," inProc. ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, Jan. 1979, pp. 134-142.
[25] B. R. Iyer, "Limits in transaction throughput--Why big is better," IBM Res. Rep. RJ 6584, Nov. 1988.
[26] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[27] S.S. Lavenberg,Computer Performance Modeling Handbook, Academic Press, New York, 1983.
[28] D. A. Menasce and T. Nakanishi, "Optimistic versus pessimistic concurrency control mechanism in database management systems,"Inform. Syst., vol. 7, no. 1, pp. 13-27, 1982.
[29] R. J. T. Morris and W. S. Wong, "Performance analysis of locking and optimistic concurrency control algorithms,"Performance Eval., vol. 5, pp. 105-118, 1985.
[30] D. Potier and P. Leblanc, "Analysis of locking policies in database management systems,"Commun. ACM, vol. 23, no. 10, pp. 584- 593, Oct. 1980.
[31] J. T. Robinson, "Experiments with transaction processing on multiprocessors," IBM Res. Rep. RC9725, Yorktown Heights, NY, Dec. 1982.
[32] 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.
[33] L. Rowe and M. Stonebraker, "The commercial INGRES epilogue," inThe INGRES Papers: Anatomy of a Relational Database System, M. Stonebraker, Ed. Reading, MA: Addison-Wesley, 1986.
[34] I. K. Ryu and A. Thomasian, "Performance analysis of centralized databased with optimistic concurrency control," Performance Evaluation 7, pp. 195-211, 1987.
[35] K. C. Sevcik, "Comparison of concurrency control methods using analytic models," inInformation Processing 83, R. E. A. Mason, Ed. Amsterdam: North Holland, 1983, pp. 847-858.
[36] M. Singhal and Y. Yesha, "A polynomial algorithm for computation of the probability of conflicts in a database under arbitrary data access distribution,"Inform. Processig Lett., vol. 27, no. 2, pp. 69-74, Feb. 1988.
[37] M. Stonebraker and L. Rowe, "The design of POSTGRES," inProc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986.
[38] Y. C. Tay, "A mean value performance model for locking in databases," Ph.D. dissertation, Harvard Univ., Cambridge, MA, Feb. 1984.
[39] 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.
[40] 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.
[41] Y. C. Tay, "Issues in modeling locking performance," inStochastic Analysis of Computer and Communication Systems, H. Takagi, Ed. Amsterdam: North-Holland, 1990, pp. 631-655.
[42] C. Thanoset al., "The effects of two-phase locking on the performance of a distributed database management system,"Performance Evaluation, vol. 8, pp. 129-157, 1988.
[43] A. Thomasian, "An iterative solution to the queueing network model of a DBMS with dynamic locking," inProc. 13th CMG Conf., 1982, pp. 252-261.
[44] 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.
[45] A. Thomasian and I. K. Ryu, "Performance analysis of two-phase locking,"IEEE Trans. Software Eng., vol. 17, no. 5, pp. 386-401, May 1991.
[46] P. S. Yu, D. M. Dias, J. T. Robinson, B. R. Iyer, and D. W. Cornell, "On coupling multi-systems through data sharing," inProc. IEEE, vol. 75, no. 5, pp. 573-587, May 1987.
[47] P.S. Yu, D. M. Dias, D. W. Cornell, and B. R. Iyer, "Analysis of affinity based routing in multi-system data sharing,"Perform. Eval., vol. 7, no. 2, pp. 87-109, June 1987.
[48] P. S. Yu and D. M. Dias, "Impact of large memory on the performance of optimistic concurrency control schemes," inProc. PARABASE-90: Int. Conf. Databases, Parallel Architectures and their Applications, Miami Beach, FL, Mar. 1990, pp. 86-90.
[49] P. S. Yu and D. M. Dias, "Analysis of hybrid concurrency control schemes for a high data contention environment,"IEEE Trans. Software Eng., vol. 18, no. 2, pp. 118-129, 1992.
[50] K. Barker and M.T. Ozzu, "Reliable Transaction Execution in Multidatabase Systems,"Proc. First Int'l Workshop Interoperability Multidatabase Systems, IEEE CS Press, Los Alamitos, Calif., Order No. 2205, 1991, pp. 344-347.

Index Terms:
concurrency control; locking; deferred blocking; transaction processing systems; performance analysis; high data contention environment; blocking probability; optimistic concurrency control; resource contention; switching point; simulation; concurrency control; distributed databases; performance evaluation; transaction processing
P.S. Yu, D.M. Dias, "Performance Analysis of Concurrency Control Using Locking with Deferred Blocking," IEEE Transactions on Software Engineering, vol. 19, no. 10, pp. 982-996, Oct. 1993, doi:10.1109/32.245740
Usage of this product signifies your acceptance of the Terms of Use.