Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication

DOI10.1145/3583668.3594599arXiv2305.11644OpenAlexW4380881694MaRDI QIDQ6202273

Unnamed Author, Bogdan S. Chlebus, Unnamed Author

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.11644

zbMATH Keywords

checkpointinglower boundgossipingauthenticationconsensuscrash failureRamanujan graphByzantine fault

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Doing-it-all with bounded work and communication
• Robust gossiping with an application to consensus
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Efficient agreement using fault diagnosis.
• Communication-efficient randomized consensus
• Efficient gossip and robust distributed computation
• A tight lower bound for randomized synchronous consensus
• Authenticated Algorithms for Byzantine Agreement
• Early stopping in Byzantine agreement
• Expander graphs and their applications
• On the Message Complexity of Indulgent Consensus
• Time and Communication Efficient Consensus for Crash Failures
• Scalable Quantum Consensus for Crash Failures
• Bounds on information exchange for Byzantine agreement
• Simple constant-time consensus protocols in realistic failure models
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Message-optimal protocols for Byzantine Agreement
• Impossibility Results for Distributed Computing
• Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
• Communication Complexity of Byzantine Agreement, Revisited
• Fast scalable deterministic consensus for crash failures
• Early-deciding consensus is expensive
• Time-optimal message-efficient work performance in the presence of faults
• Lower Bounds for Randomized Consensus under a Weak Adversary
• Breaking the O ( n ² ) bit barrier

This page was built for publication: Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication