This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Checkpointing for Optimistic Concurrency Control Methods
April 1995 (vol. 7 no. 2)
pp. 332-339

Abstract—Restart-oriented concurrency control (CC) methods, such as optimistic CC, outperform blocking-oriented methods, such as standard two-phase locking in a high data contention environment, but this is at the cost of wasted processing due to restarts. Volatile savepoints are considered in this study as a method to reduce this wasted processing and to improve response time. There is the usual tradeoff between the checkpointing overhead and the wasted processing when a transaction is restarted. Our study shows that in a system where objects are accessed and updated uniformly during the lifetime of transactions, significant improvement in performance at high data conflict levels are attainable only when checkpointing cost is low. This implies few optimally placed checkpoints per transaction. It is observed that checkpointing may result in a significant improvement in performance when accesses to database hot-spots are deferred to the final steps of transaction execution. The parametric studies reported in this paper are facilitated by closed form analytic solutions expressing system performance, as well as an iterative solution which takes into account hardware resource contention in addition to data contention.

[1] 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.
[2] N.S. Barghouti and G.E. Kaiser, "Concurrency Control in Advanced Database Applications," ACM Computing Surveys, vol. 23, pp. 269-316, Sept. 1991.
[3] N.S. Bowen and D.K. Pradhan, “Processor- and Memory-Based Checkpoint and Rollback Recovery,” Computer, vol. 26, no. 2, pp. 22-31, Feb. 1993.
[4] C.J. Date,An Introduction to Database Systems, 2nd ed., Addison-Wesley, Reading, Mass., 1977.
[5] Database Transaction Models for Advanced Applications, A.K. Elmagarmid, ed., Morgan Kaufmann Publishers, 1992.
[6] 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.
[7] 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.
[8] 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.
[9] J. Gray,P. McJones,, and M. Blasgen,“The recovery manager of the System R database manager,” ACM Computing Surveys, vol. 13, no. 2, pp. 223-242, June 1981.
[10] The Benchmark Handbook for Database and Transaction ProcessingSystems, J. Gray, ed., Morgan Kaufmann Publishers, 1991.
[11] J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kauffman, 1993.
[12] T Harder,“Observations on optimistic concurrency control schemes,” Information Systems, vol. 9, no. 2, pp. 111-120, 1984.
[13] T. Haerder and A. Reuter,“Principles of transaction-oriented database recovery,” ACM Computing Surveys, vol. 15, no. 4, pp. 287-317, Dec. 1983.
[14] 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.
[15] S.S. Lavenberg, Computer Performance Modeling Handbook. Academic Press, 1983.
[16] D.A. Menasce and T. Nakanishi,“Optimistic versus pessimistic concurrency control mechanisms in databasemanagement systems,” Information Systems, vol. 7, no. 1, pp. 13-27, Jan. 1982.
[17] R.J.T. Morris and W.S. Wong,“Performance analysis of locking and optimistic concurrency controlalgorithms,” Performance Evaluation, vol. 5, no. 2, pp. 105-118, 1985.
[18] V.F. Nicola and J.M. van Spanje, "Comparative Analysis of Different Models of Checkpointing and Recovery," IEEE Trans. Software Eng., vol. 16, no. 8, pp. 807-821, Aug. 1990.
[19] I.K. Ryu and A. Thomasian,“Performance analysis of centralized database with optimistic concurrency control,” Performance Evaluation, vol. 7, pp. 195-211, 1987.
[20] 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.
[21] A.N. Tantawi and M. Ruschitzka, "Performance Analysis of Checkpointing Strategies," ACM Trans. Computer Systems, vol. 2, pp. 123-144, May 1984.
[22] 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.
[23] A. Thomasian, "Two-Phase Locking Performance and Its Thrashing Behavior," ACM Trans. Database Systems, vol. 18, no. 3, Sept. 1993.

Index Terms:
Transaction processing, data contention, checkpointing, volatile savepoints, optimal savepoint placement, optimistic concurrency control, performance analysis, analytic modeling, flow diagrams, semi-Markov chains, queueing network models.
Citation:
Alexander Thomasian, "Checkpointing for Optimistic Concurrency Control Methods," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 2, pp. 332-339, April 1995, doi:10.1109/69.382303
Usage of this product signifies your acceptance of the Terms of Use.