Revisiting the relationship between non-blocking atomic commitment and consensus

DOI10.1007/BFB0022140MaRDI QIDQ6062519zbMATH OpenOpenAlexFDO

Authors Rachid Guerraoui

Publication date 1 December 2023

Published in Distributed Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0022140

Mathematics Subject Classification ID

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

Recommendations

• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• scientific article; zbMATH DE number 1950669
• Fast non-blocking atomic commit: an inherent trade-off
• scientific article; zbMATH DE number 1445803
• The weakest failure detectors to solve quittable consensus and nonblocking atomic commit

Cites work

• Impossibility of distributed consensus with one faulty process
• The weakest failure detector for solving consensus
• Transaction commit in a realistic timing model
• Unreliable failure detectors for asynchronous systems (preliminary version)

Cited in

(4)

• Fast non-blocking atomic commit: an inherent trade-off
• scientific article; zbMATH DE number 1747795 (Why is no real title available?)
• ``\(\varGamma\)-accurate failure detectors
• A note on atomicity: boosting Test\&Set to solve consensus

This page was built for publication: Revisiting the relationship between non-blocking atomic commitment and consensus

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