Multi-shot distributed transaction commit

DOI10.4230/LIPICS.DISC.2018.14MaRDI QIDQ5090904zbMATH OpenFDO

Authors Gregory Chockler, Alexey Gotsman

Publication date 21 July 2022

zbMATH Keywords

Paxostwo-phase commitatomic commit problem

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• Multi-shot distributed transaction commit
• Design of transaction commitment protocols
• scientific article; zbMATH DE number 2006646
• scientific article; zbMATH DE number 1747795
• scientific article; zbMATH DE number 1950669

Cites work

• A simple proof of the uniform consensus synchronous lower bound.
• Complexity of distributed commit protocols
• Increasing the resilience of distributed and replicated database systems
• The part-time parliament
• The weakest failure detector for solving consensus
• Uniform consensus is harder than consensus

Cited in

(3)

• Multi-shot distributed transaction commit
• Reconfigurable Atomic Transaction Commit
• Multiserialization of iterated transactions

This page was built for publication: Multi-shot distributed transaction commit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090904)