Timeliness, failure-detectors, and consensus performance
From MaRDI portal
Publication:5177278
DOI10.1145/1146381.1146408zbMath1314.68076OpenAlexW2145278925MaRDI QIDQ5177278
Publication date: 10 March 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1146381.1146408
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (9)
The Heard-Of model: computing in distributed systems with benign faults ⋮ Expected linear round synchronization: the missing link for linear Byzantine SMR ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ Of choices, failures and asynchrony: the many faces of set agreement ⋮ Booting clock synchronization in partially synchronous systems with hybrid process and link failures ⋮ How to Solve Consensus in the Smallest Window of Synchrony ⋮ Generating fast indulgent algorithms ⋮ Refined quorum systems ⋮ Making Byzantine consensus live
This page was built for publication: Timeliness, failure-detectors, and consensus performance
