Fast fault-tolerant agreement algorithms

DOI10.1145/1073814.1073847MaRDI QIDQ5177239zbMATH OpenOpenAlexFDO

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

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 broadcastdirty crashesearly-stopping

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Fast agreement in networks with Byzantine nodes
• Fast Byzantine agreement in dynamic networks
• Fast Byzantine agreement
• Fast Distributed Agreement
• Efficient Byzantine Agreement with Faulty Minority
• scientific article; zbMATH DE number 2080904
• FAST BROADCASTING WITH BYZANTINE FAULTS
• A faster P solution for the Byzantine agreement problem

Cited in

(4)

• scientific article; zbMATH DE number 2080904 (Why is no real title available?)
• Consensus in the presence of mortal Byzantine faulty processes
• Message and time efficient consensus protocols for synchronous distributed systems
• Fast Paxos

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

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