Non-blocking atomic commit in asynchronous distributed systems with failure detectors

DOI10.1007/S446-002-8027-4MaRDI QIDQ5138367zbMATH OpenOpenAlexWikidataFDO

Authors Rachid Guerraoui

Publication date 3 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s446-002-8027-4

zbMATH Keywords

asynchronyatomic commitconsensusfailure detectionlower bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1445803
• Fast non-blocking atomic commit: an inherent trade-off
• scientific article; zbMATH DE number 1950669
• The weakest failure detectors to solve quittable consensus and nonblocking atomic commit
• A simple and fast asynchronous consensus protocol based on a weak failure detector

Cites work

• Impossibility of distributed consensus with one faulty process
• On the hardness of failure-sensitive agreement problems.
• The Weak Byzantine Generals Problem
• The weakest failure detector for solving consensus
• Transaction commit in a realistic timing model
• Unreliable failure detectors for reliable distributed systems

Cited in

(13)

• Asynchronous bounded lifetime failure detectors
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
• Fast non-blocking atomic commit: an inherent trade-off
• scientific article; zbMATH DE number 1950669 (Why is no real title available?)
• scientific article; zbMATH DE number 1747795 (Why is no real title available?)
• scientific article; zbMATH DE number 1445803 (Why is no real title available?)
• Fair Exchange Is Incomparable to Consensus
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
• Perfect failure detection with very few bits
• Revisiting the relationship between non-blocking atomic commitment and consensus
• Parameterized complexity of safety of threshold automata
• Managed agreement: generalizing two fundamental distributed agreement problems
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems

This page was built for publication: Non-blocking atomic commit in asynchronous distributed systems with failure detectors

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