Non-Blocking Two Phase Commit Protocol Reducing the Blocking Problem

봉쇄문제를 축소한 비봉쇄 이단계 완료규약

  • Published : 2001.10.01

Abstract

An atomic commitment protocol ensures that distributed transcations terminate consistently at participating sites. An atomic commitment protocol is said to be non-blocking if it permits transaction termination to proceed at correct participants despite of failure in the coordinator site and communication. It is well known that the famous two phase commit(2PC) is a blocking protocol, whereas the three phase commit(3PC) protocol is a non-blocking. In this paper, we propose a non-blocking two phase commit(NB-2PC) protocol reducing the blocking problem than propose non-blocking protocols. The NB-2PC protocol can be obtained through modifications of the 2PC protocol. After receiving Prepare message from coordinator in the NB-2PC protocol, participants respond to the coordinator and several participants in voting phase. While participants wait for decision message from the coordinator, the blocking occurs due to the failure of the coordinator site, participants elect new coordinator among several participants receive response message. Despite of the coordinator site failures, participants consult new coordinator and follow termination protocols and achieve non-blocking property. We propose a basic structure of NB-2PC protocol and termination protocol and new coordinator election protocol. The NB-2PC protocol has non-blocking property and reduces processing time of commit protocol than the 3PC protocol. Also, through simulation experiments, we propose the NB-2PC protocol exhibits better performance of processing time of commit protocol than 3PC protocol.

원자성 완료규약 분산트랜잭션을 규약에 참여하는 사이트에 일관되게 종료할 수 있게 한다. 사이트 나 통신의 고장에도 불구하고 참여자들이 트랜잭션을 정확하게 종료할 수 있다면 이것은 봉쇄문제를 제거한 규약이라 한다. 2PC 규약은 봉쇄 규약으로 유명하고, 반면에 3PC 규약은 봉쇄문제를 해결한 규약으로 알려졌다. 본 논문에서 제안된 봉쇄 해결 규약보다 봉쇄문제를 축소한 NB-2PC 규약을 제안한다. NB-2-PC 규약은 2PC 규약과 3PC규약을 변형한 규약이다. NB-2PC 규약은 선출단계에서 참여자들이 조정자에게 Prepare 메세지를 받으면, 조정자와 여러 참여자들에게 응답 메세지를 보낸다. 참여자들은 결정 메세지를 기다리다 조정자의 고장으로 인해 봉쇄 문제가 발생하면 Prepare 메세지를 보낸 참여자들 중에서 새로운 조정자를 선출한다. 참여자는 종료규약을 수행하여 봉쇄문제를 줄인다. 본 논문에서는 NB-2PC 규약의 기본적인 구조와 종료규약, 새로운 조정자 선출 방법을 제안한다. 또한 실험을 통하여 NB-2PC 규약이 3PC 규약보다 완료규약 수행시간이 우수하다는 것을 보인다.

Keywords

References

  1. J. Gray and A. Reuter, Transaction Processing : Concepts and Techniques. Morgan Kaufman, 1993
  2. P. A. Bernstein and N. Goodman, 'Concurrency Control in Distributed Database Systems,' ACM Computing Surveys, Vol.13, No.2, pp.185-222, June 1981 https://doi.org/10.1145/356842.356846
  3. P. Bernstein, V. Hadzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987
  4. Skeen D, 'Non-blocking Commit Protocols,' Proc. of the ACM SIGMOD Int'l Conference on the Management of Data. pp.133-142, May 1981 https://doi.org/10.1145/582318.582339
  5. Lampson B, Atomic Transactions. Distributed Systems : Architecture and Implementation-An Advanced Course, B. Lampson(Ed.), Lecture Notes in Computer Science, Vol. 105, pp.246-265, Springer-Verlag, 1981
  6. Y. J. Al-Houmaily, P. K. Chrysanthis and S. P. Levitan, 'An Argument in Favor of the Presumed Commit Protocols,' CS Technical Report 96-21, University of Pittsburgh, 1996
  7. P. Krishna Reddy and Masaru Kitsuregawa, 'Reducing blocking in two-phase commit protocol employing backup sites,' In the Third IFCIS Conference on Cooperative Information Systems (CooIS '98), pp.406-415, August 20-22, 1998 https://doi.org/10.1109/COOPIS.1998.706315
  8. Samaras, G., S. D. Nikolopoulos, 'Algorithmic Techniques Incorporating Heuristic Decision in Commit Protocols,' Proc. of the 25th Euromicro Conference, Sept. 1995
  9. Systems Network Architecture, SYNC Point Services Architecture Reference, Document Number SC31-8134, IBM, Sept. 1994
  10. O. Babaoglu and S. Toueg. 'Non-Blocking Atomic Commitment,' In Sape Mullender, editor, Distributed Systems, ACM Press, 1993
  11. Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritham, 'Revisiting Commit Processing in Distributed Database Systems,' SIGMOD Conference. pp.486-497, 1997 https://doi.org/10.1145/253260.253366
  12. M. Carey and M. Livny, 'Distributed Concurrency Control Performance : A Study of Algorithms, Distribution, and Replication,' Proc. of 14th Intl. Conf. on Very Large Data Bases, August 1988
  13. M. Carey and M. Livny, 'Conflict Detection Tradeoffs for Replicated Data,' ACM Transactions on Database Systems, 16(4) : pp.703-746, 1991 https://doi.org/10.1145/115302.115289
  14. M. Scott and A. Cox, 'An Empirical Study of Message-Passing Overhead,' In ICCC 7th International Conference on Distributed Computing Systems, pp.536-543, 1987
  15. B. Lampson and D. Lomet, 'A new presumed commit optimization for two phase commit,' Proc. 19th VLDB Conference, Dublin, pp.630-640, 1993