This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
January/February 1998 (vol. 10 no. 1)
pp. 173-189

Abstract—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency and, hence, higher data contention. The conventional two-phase locking (2PL) Concurrency Control (CC) method may, therefore, restrict system throughput to levels inconsistent with the available processing capacity. This is especially a concern in shared-nothing or data-partitioned systems due to the extra latencies for internode communication and a reliable commit protocol. The optimistic CC (OCC) is a possible solution, but currently proposed methods have the disadvantage of repeated transaction restarts. We present a distributed OCC method followed by locking, such that locking is an integral part of distributed validation and two-phase commit. This method ensures at most one re-execution, if the validation for the optimistic phase fails. Deadlocks, which are possible with 2PL, are prevented by preclaiming locks for the second execution phase. This is done in the same order at all nodes. We outline implementation details and compare the performance of the new OCC method with distributed 2PL through a detailed simulation that incorporates queueing effects at the devices of the computer systems, buffer management, concurrency control, and commit processing. It is shown that for higher data contention levels, the hybrid OCC method allows a much higher maximum transaction throughput than distributed 2PL in systems with high processing capacities. In addition to the comparison of CC methods, the simulation study is used to study the effect of varying the number of computer systems with a fixed total processing capacity and the effect of locality of access in each case. We also describe several interesting variants of the proposed OCC method, including methods for handling access variance, i.e., when rerunning a transaction results in accesses to a different set of objects.

[1] D. Agrawal, A.J. Bernstein, P. Gupta, and S. Sengupta, "Distributed Optimistic Concurrency Control with Reduced Rollback," Distributed Computing, vol. 2, no. 1, pp. 45-59, 1987.
[2] 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.
[3] 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.
[4] M. Bellew, M. Hsu, and V. Tam, "Update Propagation in Distributed Memory Hierarchy," Proc. Sixth Int'l Conf. Data Eng., pp. 521-528,Los Angeles, 1990.
[5] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[6] M.J. Carey and W.A. Mouhanna, "The Performance of Multiversion Concurrency Control Algorithms," ACM Trans. Computer Systems, vol. 4, no. 4, pp. 338-378, Nov. 1986.
[7] M.J. Carey and M. Livny, "Distributed Concurrency Control Performance: A Study of Algorithms, Distribution and Replication," Proc. 14th Very Large Data Bases Conf.,Los Angeles, 1988.
[8] S. Ceri and S. Owicki, "On the Use of Optimistic Methods for Concurrency Control in Distributed Databases," Proc. Sixth Berkeley Workshop Distributed Data Management and Computer Networks, pp. 117-129, Feb. 1982.
[9] A. Delis and N. Roussopoulos, "Performance Comparison of Three Modern DBMS Architectures," IEEE Trans. Software Eng., vol. 19, no. 2, pp. 120-138, Feb. 1993.
[10] D.H. Fishman, M. Lai, and W.K. Wilkinson, "Overview of the Jasmin Database Machine," Proc. ACM SIGMOD Conf. Management Data, pp. 234-239, 1984.
[11] 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.
[12] P.A. Franaszek, J.T. Robinson, and A. Thomasian, “Access Invariance and Its Use in High Contention Environment,” Proc. Seventh Int'l Conf. Data Eng., pp. 47-55, Feb. 1990.
[13] P.A. Franaszek, J.T. Robinson, and A. Thomasian, "Wait Depth Limited Concurrency Control," Proc. Seventh Int'l Data Eng. Conf.,Kobe, Japan, pp. 92-101, Apr. 1991.
[14] 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.
[15] P.A. Franaszek, J.R. Haritsa, J.T. Robinson, and A. Thomasian, "Distributed Concurrency Control with Limited Wait Depth," Proc. 12th Int'l Conf. Distributed Computing Systems,Yokohama, Japan, pp. 160-167, June 1992.
[16] 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.
[17] J.N. Gray, "The Cost of Messages," Proc. Seventh Ann. Symp. Principles of Distributed Computing,Toronto, Ont., Canada, pp. 1-7, Aug. 1988.
[18] J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kauffman, 1993.
[19] P. Heidelberger and M.S. Lakshmi, "A Performance Comparison of Multimicro and Mainframe Database Architectures," IEEE Trans. Software Eng., vol. 14, no. 4, pp. 522-531, Apr. 1988.
[20] H. Hsiao and D.J. DeWitt, “Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines,” Proc. Data Eng., pp. 456–465, 1990.
[21] B.C. Jenq, B.C. Twichell, and T.W. Keller, "Locking Performance in a Shared Nothing Parallel Database Machine," IEEE Trans. Knowledge and Data Eng., vol. 1, no. 4, pp. 530-543, Dec. 1989.
[22] M.L. Kersten and H. Tebra, "Application of an Optimistic Concurrency Control Method," Software—Practice and Experience, vol. 14, no. 2, pp. 153-168, 1984.
[23] E. Knapp, "Deadlock Detection in Distributed databases Systems," ACM Computing Surveys, pp. 303-328, Dec. 1987.
[24] W.J. Kohler and B.P. Jenq, "Performance Evaluation of Integrated Concurrency Control and Recovery Algorithms Using a Distributed Transaction Testbed," Proc. Sixth IEEE Int'l Conf. Distributed Computing Systems,Boston, pp. 130-139, Sept. 1986.
[25] H.T. Kung and J.T. Robinson, "On Optimistic Methods for Concurrency Control," ACM Trans. Database Systems, vol. 6, no. 2, pp. 213-226, June 1981.
[26] G. Lausen, "Concurrency Control in Database Systems: A Step Towards the Integration of Optimistic Methods and Locking," Proc. ACM Ann. Conf., pp. 64-68, 1982.
[27] S.S. Lavenberg, Computer Performance Modeling Handbook. Academic Press, 1983.
[28] M.D.P. Leland and W.D. Roome, "The Silicon Database Machine," Proc. Fourth Int'l Workshop Database Machines, pp. 169-189, Springer-Verlag, 1985.
[29] C. Mohan, H. Pirahesh, and R. Lorie, “Efficient and Flexible Methods for Transient Versioning of Records to Avoid Locking by Read-Only Transactions,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 124–133, June 1992.
[30] S.J. Mullender and A.S. Tanenbaum, "A Distributed File Service Based on Optimistic Concurrency Control," Proc. 10th ACM Symp. Operating System Principles, pp. 51-62, 1985.
[31] E. Rahm, "Design of Optimistic Methods for Concurrency Control in Database Sharing Systems," Proc. Seventh IEEE Int'l Conf. Distributed Computing Systems,West Berlin, pp. 154-161, Sept. 1987.
[32] E. Rahm, "Concepts for Optimistic Concurrency Control in Centralized and Distributed Database Systems," IT Informationstechnik, (in German), vol. 30, no. 1, pp. 28-47, 1988.
[33] E. Rahm, "Empirical Performance Evaluation of Concurrency and Coherency Control Protocols for Database Sharing Systems," ACM Trans. Database Systems, vol. 18, no. 2, pp. 333-377, June 1993.
[34] A. Reuter and K. Shoens, "Synchronization in a Data Sharing Environment," unpublished report, IBM San Jose Research Center, 1984.
[35] J.T. Robinson, "Experiments with Transaction Processing on a Multi-Microprocessor System," IBM Research Report RC 9725, Yorktown Heights, N.Y., Dec. 1982.
[36] W.D. Roome, "The Intelligent Store: A Content-Addressable Page Manager," Bell Systems Technical J., vol. 61, no. 9, pp. 2,567-2,596, 1982.
[37] 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.
[38] I.K. Ryu and A. Thomasian,“Performance analysis of centralized database with optimistic concurrency control,” Performance Evaluation, vol. 7, pp. 195-211, 1987.
[39] J.W. Stamos and F. Cristian, "A Low-Cost Atomic Commit Protocol," Proc. Ninth Symp. Reliable Distributed Systems,Huntsville, Ala., pp. 66-75, Oct. 1990.
[40] 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.
[41] A. Thomasian, "Performance Limits of Two-Phase Locking," Proc. Seventh IEEE Int'l Conf. Data Eng.,Kobe, Japan, pp. 426-435, Apr. 1991.
[42] A. Thomasian, "On the Number of Remote Sites Accessed in Distributed Transaction Processing," IEEE Trans. Parallel and Distributed Processing, vol. 4, no. 1, pp. 99-103, Jan. 1993.
[43] A. Thomasian, "Two-Phase Locking Performance and Its Thrashing Behavior," ACM Trans. Database Systems, vol. 18, no. 3, Sept. 1993.
[44] A. Thomasian and E. Rahm, "A New Distributed Optimistic Concurrency Control Method and a Comparison of Its Performance with Two-Phase Locking," Proc. 10th Int'l Distributed Computing Conf.,Paris, pp. 294-301, May 1990.
[45] A. Thomasian and I. Ryu, "A Decomposition Solution to the Queueing Network Model of the Centralized dbms with Static Locking," Proc. ACM SIGMETRICS, pp. 82-92, 1983.
[46] 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.
[47] A. Thomasian, Database Concurrency Control: Methods, Performance, and Analysis, Kluwer Academic, 1996.
[48] P.S. Yu, D.W. Cornell, D.M. Dias, and A. Thomasian, "On Coupling Partitioned Data Systems," Proc. Sixth IEEE Int'l Conf. Distributed Computing Systems,Boston, pp. 148-157, Sept. 1986.

Index Terms:
Distributed database systems, transaction processing, optimistic concurrency control, access invariance, commit protocols, system performance modeling.
Citation:
Alexander Thomasian, "Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 1, pp. 173-189, Jan.-Feb. 1998, doi:10.1109/69.667102
Usage of this product signifies your acceptance of the Terms of Use.