Consensus on Transaction Commit

Details Consensus on Transaction Commit Consensus on Transaction Commit

2004-08-14

arxiv.org/abs/cs/0408036v1

Computer Science

Distributed, Parallel, and Cluster Computing

Original at http://research.microsoft.com/research/pubs/view.aspx?tr_id=701

Scientific paper

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. Running a Paxos consensus algorithm on the commit/abort decision of each participant yields a transaction commit protocol that uses 2F +1 coordinators and makes progress if at least F +1 of them are working. In the fault-free case, this algorithm requires one extra message delay but has the same stable-storage write delay as Two-Phase Commit. The classic Two-Phase Commit algorithm is obtained as the special F = 0 case of the general Paxos Commit algorithm.

Affiliated with

Also associated with

No associations

Rating

Consensus on Transaction Commit does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Consensus on Transaction Commit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consensus on Transaction Commit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-596785