Consensus on transaction commit
作者： Jim Gray , Leslie Lamport
关键词: Paxos 、 Atomic commit 、 Computer science 、 Distributed transaction 、 Computer security 、 X/Open XA 、 Compensating transaction 、 Commit 、 Three-phase commit protocol 、 Two-phase commit protocol 、 Information Systems
摘要: The distributed transaction commit problem requires reaching agreement on whether a is committed or aborted. classic Two-Phase Commit protocol blocks if the coordinator fails. Fault-tolerant consensus algorithms also reach agreement, but do not block whenever any majority of processes are working. Paxos algorithm runs commit/abort decision each participant to obtain that uses 2F p 1 coordinators and makes progress at least F them working properly. has same stable-storage write delay, can be implemented have message delay in fault-free case as Commit, it more messages. obtained special = 0 algorithm.
acm.org
berkeley.edu 参考文章(20)
Eric Newcomer, Understanding Web Services: XML, WSDL, SOAP, and UDDI ,(2002)
Andrea J. Borr, Transaction monitoring in ENCOMPASS: reliable distributed transaction processing very large data bases. pp. 155- 165 ,(1981)
Nathan Goodman, Philip A. Bernstein, Vassco Hadzilacos, Concurrency Control and Recovery in Database Systems ,(1987)
Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg, Stable Leader Election international symposium on distributed computing. pp. 108- 122 ,(2001) , 10.1007/3-540-45414-4_8
Roberto De Prisco, Butler Lampson, Nancy Lynch, Revisiting the Paxos Algorithm international workshop on distributed algorithms. pp. 111- 125 ,(1997) , 10.1007/BFB0030679
Rachid Guerraoui, Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus international workshop on distributed algorithms. pp. 87- 100 ,(1995) , 10.1007/BFB0022140
R. Guerraoui, M. Larrea, A. Schiper, Reducing the cost for non-blocking in atomic commitment international conference on distributed computing systems. pp. 692- 697 ,(1996) , 10.1109/ICDCS.1996.508021
J. Roy, A. Ramanujan, Understanding Web services IT Professional. ,vol. 3, pp. 69- 73 ,(2001) , 10.1109/6294.977775
C. Mohan, R. Strong, S. Finkelstein, Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors principles of distributed computing. pp. 89- 103 ,(1983) , 10.1145/800221.806712
Cynthia Dwork, Nancy Lynch, Larry Stockmeyer, Consensus in the presence of partial synchrony Journal of the ACM. ,vol. 35, pp. 288- 323 ,(1988) , 10.1145/42282.42283