Consensus on Transaction Commit
Jim Gray, Leslie Lamport
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. 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.
Create a lesson
Related papers
A Distributed Energy Relay Framework for Sustainable Drone Missions
I-Ling Yen, Farokh Bastani, Akeem Mohammed et al.
Orrery: Modeling and Simulation of GPU-direct MPI Communication with SimGrid
Ahmad Moh'd Saleh A. Belbeisi, Amir Raoofy, Josef Weidendorfer et al.
Revisiting Cauchy-Schwarz Norm Bounds for SDC Detection in LLM Inference
Anton Altenbernd, Dylan Everingham, Philipp Wiesner et al.
Tremulant: Latency in Serverless Platforms beyond the 99th Percentile
Linus Gustafsson, Trever Schirmer, David Bermbach
FastEEP: Fast Intra-Instance Elastic Scaling for Expert-Parallel MoE Serving
Yunfei Feng, Jingkai He, Shiqi Liu et al.
LunaTP: Enabling Efficient and Scalable Tensor Product for Equivariant MLIPs
Yuanchang Zhou, Mingzhen Li, Chen Wang et al.