Perfect failure detection with very few bits

DOI10.1016/j.ic.2020.104604zbMath1496.68050OpenAlexW3044456821MaRDI QIDQ5919048

Sergio Rajsbaum, Corentin Travers, Pierre Fraigniaud, Petr Kuznetsov, Thibault Rieutord

Publication date: 15 December 2020

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01365304/file/fdenc-longversion.pdf

zbMATH Keywords

well-quasi-orderHigman's lemmafailure detectorsdistributed encoding

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On termination detection in crash-prone distributed systems with failure detectors
• The minimum information about failures for solving non-local tasks in message-passing systems
• The weakest failure detector for eventual consistency
• On the computability power and the robustness of set agreement-oriented failure detector classes
• The theory of well-quasi-ordering: a frequently discovered concept
• Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings
• The failure detector abstraction
• Every problem has a weakest failure detector
• The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• Ordering by Divisibility in Abstract Algebras
• The Power of Priority Channel Systems
• Perfect failure detection with very few bits

This page was built for publication: Perfect failure detection with very few bits