Perfect failure detection with very few bits

DOI10.1016/J.IC.2020.104604MaRDI QIDQ5919048zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, 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

distributed encodingfailure detectorsHigman's lemmawell-quasi-order

Mathematics Subject Classification ID

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

Recommendations

• Perfect failure detection with very few bits
• Asynchronous failure detectors
• The failure detector abstraction
• Communication-optimal eventually perfect failure detection in partially synchronous systems
• scientific article; zbMATH DE number 2013834

Cites work

• Every problem has a weakest failure detector
• scientific article; zbMATH DE number 3914378 (Why is no real title available?)
• Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• On termination detection in crash-prone distributed systems with failure detectors
• On the computability power and the robustness of set agreement-oriented failure detector classes
• Ordering by Divisibility in Abstract Algebras
• Perfect failure detection with very few bits
• The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
• The failure detector abstraction
• The minimum information about failures for solving non-local tasks in message-passing systems
• The power of priority channel systems
• The theory of well-quasi-ordering: a frequently discovered concept
• The weakest failure detector for eventual consistency
• The weakest failure detector for solving consensus
• Unreliable failure detectors for reliable distributed systems

Cited in

(5)

• On scalable and efficient distributed failure detectors
• scientific article; zbMATH DE number 2013837 (Why is no real title available?)
• Communication-optimal eventually perfect failure detection in partially synchronous systems
• An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
• Perfect failure detection with very few bits

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

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