On implementing omega with weak reliability and synchrony assumptions
From MaRDI portal
Publication:2943769
Recommendations
- On implementing omega in systems with weak reliability and synchrony assumptions
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- From W to : A simple bounded quiescent reliable broadcast-based transformation
- Exploiting omissive faults in synchronous approximate agreement
- On the inherent weakness of conditional synchronization primitives
- Anti-Ω
- Anti-\(\Omega \): the weakest failure detector for set agreement
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
- Synchronous consensus with optimal asynchronous fallback guarantees
Cited in
(11)- On implementing omega in systems with weak reliability and synchrony assumptions
- On the inherent weakness of conditional synchronization primitives
- When consensus meets self-stabilization
- A simple and communication-efficient omega algorithm in the crash-recovery model
- From W to : A simple bounded quiescent reliable broadcast-based transformation
- Distributed Computing
- Communication-optimal eventually perfect failure detection in partially synchronous systems
- Self-stabilizing indulgent zero-degrading binary consensus
- Communication-efficient and crash-quiescent omega with unknown membership
- Implementing unreliable failure detectors with unknown membership
- Implementing the Omega failure detector in the crash-recovery failure model
This page was built for publication: On implementing omega with weak reliability and synchrony assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943769)