Optimization of Commit Protocols
Much of the literature focuses on improving performance in failure cases by providing a non-blocking 2PC that streamlines recovery processing at the expense of extra processing in the normal case. We focused on improving performance in the normal case based on two assumptions: first, that networks and systems are becoming increasingly reliable, and second, that the need to support high-volume transactions requires a streamlined protocol for the normal case. Our work resulted in a number of optimizations most of which have been incorporated in IBM and non-IBM transactional offerings. These optimizations were presented and analyzed in terms of reliability, savings in log writes and network traffic, and reduction in resource lock time. Our work's unique contributions include the description of some optimizations not described elsewhere in the literature and a systematic comparison of the optimizations and the environments where they cause the most benefit. Furthermore, it analyzed the feasibility and performance of several combinations of the optimizations and identifies situations where optimizations can be combined effectively. Optimizing for the non-failure case has been, also, demonstrated through this work as the correct approach towards commit optimization. These results have been published in the refered following publications and have significantly influence further work in commit protocols.
Related Publications
Journals
Samaras G., K. Britton, A. Citron, C. Mohan (1995) "Two-Phase Commit Optimizations in a Commercial Distributed Environment", Distributed and Parallel Databases Journal/An International Journal, 3(4): 325-360, October, 1995
Conferences and Workshops
Obermeier, S. Bottcher, S. Hett, M. Chrysanthis, P.K. Samaras, G. (2008) "Adjourn State Concurrency Control Avoiding Time-Out Problems in Atomic Commit Protocols", Proc. of the 21th IEEE International Conference on Data Engineering (ICDE 2008), Sponsored by the IEEE Computer Society, Cancun, Mexico, April 7-13, 2008, pp. 1477-1479
George Samaras, Geroge K. Kyrou, Panos K. Chrysanthis (2003) "Two-Phase Commit Processing with Restructured Commit Tree", Advances in Informatics, Lecture Notes on Computer Science Series, LNCS Volume 2563, Springer Verlarg, 2003
Samaras, G., Kyrou G., P. Chrysanthis (2001) "Structuring the Commit Tree to Improve Commit Processing", Proc. 9th Hellenic Conference on Informatics (HCI’99), pp. 82-99, Nicosia, Cyprus, November 2001
Mohan, C., K. Britton, A. Citron, G. Samaras (1996) "Generalized Presumed Abort: Marrying Presumed Abort and SNA's LU6.2 Commit Protocols", Proc. International Workshop on Advance Transaction Models and Architectures (ATMA 1996) (Edited Book), Goa, India, September 1996 (Held in conjunction with VLDB'96). Extended version of the HPTS'93 paper
Mohan, C., K. Britton, A. Citron, G. Samaras (1993) "Generalized Presumed Abort: Marrying Presumed Abort and SNA's LU6.2 Commit Protocols", Proc. 4th International Workshop on High Performance Transaction Systems (HPTS’93), Asilomar, September 1993
Samaras G., K. Britton, A. Citron, C. Mohan (1993) "Two-Phase Commit Optimizations and Trade offs in the Commercial Environment", Proc. 9th IEEE International Data Engineering Conference (ICDE’93), pp. 520-529, Vienna, April 1993
Reports
Samaras G., K. Britton, A. Citron, C. Mohan (1993) "Commit Processing Optimizations in the Commercial Distributed Environment.", IBM Research Report, TR# 29.1625 IBM Research Triangle Park, March 1993
Mohan, C., K. Britton, A. Citron, G. Samaras (1992) "Generalized Presumed Abort: Marrying Presumed Abort and SNA's LU6.2 Commit Protocols", IBM Research Report, RJ8684, IBM Almaden Research Center, March 1992
Samaras G., K. Britton, A. Citron, C. Mohan (1992) "Two-Phase Commit Optimizations and Trade offs in the Commercial Environment", IBM Research Report, TR# 29.1347 IBM RTP, March 1992
Contact phone: +375 22 89 26 98