Randomization and failure detection: a hybrid approach to solve consensus
From MaRDI portal
Publication:6570909
DOI10.1007/3-540-61769-8_3zbMATH Open1541.68024MaRDI QIDQ6570909FDOQ6570909
Authors: Marcos Kawazoe Aguilera, Sam Toueg 
Publication date: 11 July 2024
Randomized algorithms (68W20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Unreliable failure detectors for reliable distributed systems
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- The weakest failure detector for solving consensus
- Unreliable failure detectors for asynchronous systems (preliminary version)
- 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
- An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
- Randomization and failure detection: a hybrid approach to solve consensus
Cited In (1)
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)
