The failure detector abstraction

DOI10.1145/1883612.1883616zbMath1293.68053OpenAlexW2026634636MaRDI QIDQ2875042

Petr Kuznetsov, Felix C. Freiling, Rachid Guerraoui

Publication date: 13 August 2014

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://ub-madoc.bib.uni-mannheim.de/1154/1/TR_2006_003.pdf

zbMATH Keywords

synchronylivenesssafetyfault tolerancedistributed systemmessage passingconsensusagreement problematomic commit

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (6)

Implementing ♢P with Bounded Messages on a Network of ADD Channels ⋮ When consensus meets self-stabilization ⋮ Consensus in anonymous asynchronous systems with crash-recovery and omission failures ⋮ The weakest failure detector for eventual consistency ⋮ Perfect failure detection with very few bits ⋮ Characterizing Consensus in the Heard-Of Model

This page was built for publication: The failure detector abstraction