On the hardness of failure-sensitive agreement problems.

DOI10.1016/S0020-0190(00)00171-XzbMath1052.68013WikidataQ127203163 ScholiaQ127203163MaRDI QIDQ1603446

Rachid Guerraoui

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Distributed computingFault-toleranceElectionAgreementBroadcastCommitFailure detector

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (5)

Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications ⋮ An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values ⋮ The perfectly synchronized round-based model of distributed computing ⋮ Non-blocking atomic commit in asynchronous distributed systems with failure detectors ⋮ Higher-order quantifier elimination, counter simulations and fault-tolerant systems

Cites Work

• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus

This page was built for publication: On the hardness of failure-sensitive agreement problems.