You only live multiple times: a blackbox solution for reusing crash-stop algorithms in realistic crash-recovery settings
From MaRDI portal
(Redirected from Publication:5091093)
Recommendations
Cites work
- Asynchronous consensus and broadcast protocols
- Combining shared-coin algorithms
- Decomposition of distributed programs into communication-closed layers
- Defining liveness
- Early consensus in an asynchronous system with a weak failure detector
- Failure detection and consensus in the crash-recovery model
- How to Solve Consensus in the Smallest Window of Synchrony
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- In search of lost time
- Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
- Reaching Agreement in the Presence of Faults
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Safe termination detection in an asynchronous distributed system when processes may crash and recover
- The part-time parliament
- Unreliable failure detectors for reliable distributed systems
This page was built for publication: You only live multiple times: a blackbox solution for reusing crash-stop algorithms in realistic crash-recovery settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091093)
