Randomization and failure detection: a hybrid approach to solve consensus

DOI10.1007/3-540-61769-8_3zbMATH Open1541.68024MaRDI QIDQ6570909FDOQ6570909

Authors Marcos Kawazoe Aguilera, Sam Toueg 

Publication date 11 July 2024

Mathematics Subject Classification ID

Randomized algorithms (68W20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
• A simple and fast asynchronous consensus protocol based on a weak failure detector
• Randomized protocols for asynchronous consensus
• Randomized consensus in expected \(O(n \log n)\) individual work
• Tight bounds for asynchronous randomized consensus

Cites work

• An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Randomization and failure detection: a hybrid approach to solve consensus
• Simple constant-time consensus protocols in realistic failure models
• The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
• The weakest failure detector for solving consensus
• The weakest failure detector for solving consensus
• Unreliable failure detectors for asynchronous systems (preliminary version)
• Unreliable failure detectors for reliable distributed systems

Cited in

(1)

• Randomization and failure detection: a hybrid approach to solve consensus

This page was built for publication: Randomization and failure detection: a hybrid approach to solve consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570909)