Early consensus in an asynchronous system with a weak failure detector
From MaRDI portal
Publication:5137337
DOI10.1007/S004460050032zbMATH Open1448.68159OpenAlexW2155168782MaRDI QIDQ5137337FDOQ5137337
Authors: A. Schiper
Publication date: 2 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004460050032
Recommendations
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
- The weakest failure detector for solving consensus
- The weakest failure detector for solving consensus
- Unreliable failure detectors for reliable distributed systems
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cited In (19)
- Timeliness, failure-detectors, and consensus performance
- Byzantine Fault Detectors for Solving Consensus
- Restricted failure detectors: Definition and reduction protocols
- The weakest failure detector for solving consensus
- Fault-tolerant consensus with an abstract MAC layer
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks
- You only live multiple times: a blackbox solution for reusing crash-stop algorithms in realistic crash-recovery settings
- Consensus in Byzantine asynchronous systems
- A necessary and sufficient condition for transforming limited accuracy failure detectors
- A flexible formal framework for masking/demasking faults
- A simple proof of the uniform consensus synchronous lower bound.
- Communication-optimal eventually perfect failure detection in partially synchronous systems
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- The weakest failure detector to solve nonuniform consensus
- The weakest failure detector to solve nonuniform consensus
- Handling message semantics with Generic Broadcast protocols
- Leaderless state-machine replication: specification, properties, limits
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
This page was built for publication: Early consensus in an asynchronous system with a weak failure detector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137337)