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

DOI10.1007/s446-002-8027-4zbMath1448.68104OpenAlexW2015135700WikidataQ60019891 ScholiaQ60019891MaRDI QIDQ5138367

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

lower boundconsensusasynchronyfailure detectionatomic commit

Mathematics Subject Classification ID

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

Related Items (6)

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Managed agreement: generalizing two fundamental distributed agreement problems ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Perfect failure detection with very few bits ⋮ Asynchronous bounded lifetime failure detectors ⋮ Fair Exchange Is Incomparable to Consensus

Cites Work

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

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