Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
From MaRDI portal
Publication:990091
DOI10.1016/J.IPL.2009.09.013zbMATH Open1206.68060OpenAlexW2132163014MaRDI QIDQ990091FDOQ990091
Authors: Wei Chen, Jialin Zhang 
Publication date: 2 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.09.013
Recommendations
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
- Uniform consensus is harder than consensus
- EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST
- Bounded cost algorithms for multivalued consensus using binary consensus instances
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Impossibility of distributed consensus with one faulty process
- The weakest failure detector for solving consensus
- The weakest failure detectors to solve certain fundamental problems in distributed computing
- Bounded cost algorithms for multivalued consensus using binary consensus instances
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
- Structured derivations of consensus algorithms for failure detectors
- Distributed Computing
- Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Cited In (3)
This page was built for publication: Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990091)
