A necessary and sufficient condition for transforming limited accuracy failure detectors
From MaRDI portal
Recommendations
Cites work
- \(K\)-set agreement with limited accuracy failure detectors
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- Early consensus in an asynchronous system with a weak failure detector
- Impossibility of distributed consensus with one faulty process
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- On the minimal synchronism needed for distributed consensus
- Restricted failure detectors: Definition and reduction protocols
- Structured derivations of consensus algorithms for failure detectors
- Unreliable failure detectors for reliable distributed systems
Cited in
(9)- Restricted failure detectors: Definition and reduction protocols
- A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
- The Theta-Model: achieving synchrony without clocks
- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
- Unreliable failure detectors for reliable distributed systems
- Wait-Free Dining Under Eventual Weak Exclusion
- ``\(\varGamma\)-accurate failure detectors
- The asynchronous bounded-cycle model
- From W to : A simple bounded quiescent reliable broadcast-based transformation
This page was built for publication: A necessary and sufficient condition for transforming limited accuracy failure detectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878682)