An Efficient Non-Blocking Commit Protocol

Abstract:

Article Preview

The two-phase commit protocol is widely used in distributed database systems to ensure the atomicity of distributed transaction. The traditional two-phase commit protocol fails to solve the blocking problem when the coordinator is out of service. Three-phase non-blocking commit protocol was designed to solve the blocking problem of two phase commit protocol, but it brought heavy communication and log overhead between sites. In todays distributed database systems, due to the growing large number of sites, the failure of single point become more and more often. The traditional commit protocol has become a bottleneck of the system. In this paper, a new non-blocking two-phase commit protocol is proposed to solve the blocking problem. Compared to the traditional three-phase commit protocol, the proposed protocol reduces the log and communication overhead. Theoretical proof has been given to show that the proposed commit protocol is non-blocking and meet the ACID properties under variety of failure conditions.

Info:

Periodical:

Edited by:

Bale V. Reddy

Pages:

1692-1696

DOI:

10.4028/www.scientific.net/AMM.325-326.1692

Citation:

W. J. Huang et al., "An Efficient Non-Blocking Commit Protocol", Applied Mechanics and Materials, Vols. 325-326, pp. 1692-1696, 2013

Online since:

June 2013

Export:

Price:

$38.00

[1] J. Gray: Notes on data base operating systems In: Operating Systems: An Advanced Course, (1978).

[2] AJ. Borr: Transaction monitoring in encompass: Reliable distributed transaction processingIn Proceedings of the 1981 ACM SIGMOD international conference on Management of data ACM Press, New York, NY, 155–165.

[3] D. Skeen: Nonblocking commit protocols, In Proceedings of the 1981 ACM SIGMOD international conference on Management of data, Ann Arbor, Michigan, pp.133-142.

DOI: 10.1145/582338.582339

[4] P.A. Bernstein,V. hadzilacosand N. Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA, (1987).

[5] N. Soparkar,E. Levy, H.F. Korthand A. Silberschatz: Adaptive commitment for real-time distributed transaction. Technical Report TR-92-15, (1992).

[6] Y. Yoon, M. Han, J. Cho: Real-time commit protocol for distributed real-time database systems. In: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems, 21–25 October 1996, p.221–225 (150).

DOI: 10.1109/iceccs.1996.558417

[7] J Haritsa, K Ramamrithamand R. Gupta: The PROMPT real-time commit protoco1. IEEE Trans on Parallel and Distributed Systems, 2000, 11(2): 160-181.

DOI: 10.1109/71.841752

[8] Y. Xiai,Y. Jinmin and F. Qiang: An Improved Two-phase Commit Protocol Adapted to the Distributed Real-time Transactions. PRZEGLĄD ELEKTRO TECHNICZ- NY (Electrical Review), R. 88 NR 5b/(2012).

[9] A. Houmaily, Y.J. Chrysanthis, P.K. Levitan, S.P.: Enhancing the performance of presumed commitprotocol. In: Proceedings of the ACM Symposium on Applied Computing, San Jose, CA, USA, 28 February–1 March (1997).

[10] AHoumaily, Y.J. Chrysanthis, P.K. Levitan, S.P.: An argument in favor of the presumed commitprotocol. In: Proceedings of the IEEE International Conference on Data Engineering, Birmingham, April (1997).

In order to see related information, you need to Login.