Randomized protocols for asynchronous consensus
From MaRDI portal
Publication:5138489
DOI10.1007/s00446-002-0081-5zbMath1448.68063arXivcs/0209014OpenAlexW2040993775MaRDI QIDQ5138489
Publication date: 4 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0209014
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (9)
Switched PIOA: parallel composition via distributed scheduling ⋮ On the Validity of Consensus ⋮ A reduction theorem for randomized distributed algorithms under weak adversaries ⋮ Task-structured probabilistic I/O automata ⋮ On the complexity of basic abstractions to implement consensus ⋮ Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction ⋮ Randomized consensus with regular registers ⋮ Communication-efficient randomized consensus ⋮ The epigenetic consensus problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
- The power of multiobjects.
- The correctness proof of Ben-Or's randomized consensus algorithm
- Consensus numbers of multi-objects
- Polylog randomized wait-free consensus
- An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
- Wait-free synchronization in multiprogrammed systems
- Lower bounds for distributed coin-flipping and randomized consensus
- Fault-tolerant wait-free shared objects
- Fast randomized consensus using shared memory
- Wait-free consensus with infinite arrivals
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Reaching Agreement in the Presence of Faults
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
- Time-Lapse Snapshots
- Bounds on the time to reach agreement in the presence of timing uncertainty
- Time-Adaptive Algorithms for Synchronization
- Computing with faulty shared objects
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Robust wait-free hierarchies
- Time- and Space-Efficient Randomized Consensus
- Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
- Fast deterministic consensus in a noisy environment
- Fast asynchronous Byzantine agreement with optimal resilience
- Software transactional memory
- Determining consensus numbers
- Efficient asynchronous consensus with the weak adversary scheduler
This page was built for publication: Randomized protocols for asynchronous consensus
