Consensus on transaction commit Export

@article{citeulike:687464, abstract = {The distributed transaction commit problem requires reaching agreement on whether a transaction is committed or aborted. The 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 the processes are working. The Paxos Commit algorithm runs a Paxos consensus algorithm on the commit/abort decision of each participant to obtain a transaction commit protocol that uses 2 F \+ 1 coordinators and makes progress if at least F \+ 1 of them are working properly. Paxos Commit has the same stable-storage write delay, and can be implemented to have the same message delay in the fault-free case as Two-Phase Commit, but it uses more messages. The classic Two-Phase Commit algorithm is obtained as the special F \= 0 case of the Paxos Commit algorithm.}, address = {New York, NY, USA}, author = {Gray, Jim and Lamport, Leslie}, citeulike-article-id = {687464}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1132863.1132867}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1132863.1132867}, doi = {10.1145/1132863.1132867}, issn = {0362-5915}, journal = {ACM Trans. Database Syst.}, keywords = {concurrency, distribution, process, transaction}, month = {March}, number = {1}, pages = {133--160}, posted-at = {2006-06-06 22:06:49}, priority = {5}, publisher = {ACM}, title = {Consensus on transaction commit}, url = {http://dx.doi.org/10.1145/1132863.1132867}, volume = {31}, year = {2006} }

TY - JOUR ID - citeulike:687464 L3 - citeulike-article-id:687464 N2 - The distributed transaction commit problem requires reaching agreement on whether a transaction is committed or aborted. The 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 the processes are working. The Paxos Commit algorithm runs a Paxos consensus algorithm on the commit/abort decision of each participant to obtain a transaction commit protocol that uses 2 F + 1 coordinators and makes progress if at least F + 1 of them are working properly. Paxos Commit has the same stable-storage write delay, and can be implemented to have the same message delay in the fault-free case as Two-Phase Commit, but it uses more messages. The classic Two-Phase Commit algorithm is obtained as the special F = 0 case of the Paxos Commit algorithm. IS - 1 JF - ACM Trans. Database Syst. SN - 0362-5915 AD - New York, NY, USA EP - 160 TI - Consensus on transaction commit PB - ACM VL - 31 SP - 133 KW - concurrency KW - distribution KW - process KW - transaction AU - Gray, Jim AU - Lamport, Leslie PY - 2006/03// UR - http://dx.doi.org/10.1145/1132863.1132867 ER -