Fast fault-tolerant agreement algorithms

DOI10.1145/1073814.1073847zbMath1314.68370OpenAlexW2081311994MaRDI QIDQ5177239

Sam Toueg, Hugues Fauconnier, Stephanie Lorraine Horn, Carole Delporte-Gallet

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073847

zbMATH Keywords

lower boundsconsensusterminating reliable broadcastearly-stoppingdirty crashes

Mathematics Subject Classification ID

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 (2)

Consensus in the presence of mortal Byzantine faulty processes ⋮ Message and time efficient consensus protocols for synchronous distributed systems

This page was built for publication: Fast fault-tolerant agreement algorithms