Communication-efficient failure detection and consensus in omission environments
From MaRDI portal
Recommendations
- Failure detection and consensus in the crash-recovery model
- Theoretical Aspects of Computing – ICTAC 2005
- Communication-optimal eventually perfect failure detection in partially synchronous systems
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
- Unreliable failure detectors for reliable distributed systems
Cites work
- scientific article; zbMATH DE number 2006647 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Distributed agreement in the presence of processor and communication faults
- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
- Impossibility of distributed consensus with one faulty process
- On implementing omega in systems with weak reliability and synchrony assumptions
- Reaching Agreement in the Presence of Faults
- Theoretical Aspects of Computing – ICTAC 2005
- Unreliable failure detectors for reliable distributed systems
Cited in
(8)- Failure detection and consensus in the crash-recovery model
- Theoretical Aspects of Computing – ICTAC 2005
- Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
- scientific article; zbMATH DE number 2013842 (Why is no real title available?)
- Communication-optimal eventually perfect failure detection in partially synchronous systems
- A distributed leader election algorithm in crash-recovery and omissive systems
- Communication-efficient and crash-quiescent omega with unknown membership
- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
This page was built for publication: Communication-efficient failure detection and consensus in omission environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944087)