Consensus on Transaction Commit
| dc.creator | Gray, Jim | |
| dc.creator | Lamport, Leslie | |
| dc.date | 2004-08-14 | |
| dc.date.accessioned | 2026-07-07T03:21:40Z | |
| dc.date.available | 2026-07-07T03:21:40Z | |
| dc.description | 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. | |
| dc.description | Original at http://research.microsoft.com/research/pubs/view.aspx?tr_id=701 | |
| dc.identifier | https://arxiv.org/abs/cs/0408036 | |
| dc.identifier | http://arxiv.org/abs/cs/0408036 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32293 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | Databases | |
| dc.subject | C.4 | |
| dc.title | Consensus on Transaction Commit | |
| dc.type | text |