Fast scalable deterministic consensus for crash failures

DOI10.1145/1582716.1582738MaRDI QIDQ5170308zbMATH OpenOpenAlexFDO

Authors Bogdan S. Chlebus, Dariusz R. Kowalski, Michał Strojnowski

Publication date 23 July 2014

Published in Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

bit communication complexityconsensusfault tolerancegraph expansionmessage passingscalabilitysynchrony

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Time and Communication Efficient Consensus for Crash Failures
• Fast and simple distributed consensus
• Robust gossiping with an application to consensus
• Early-deciding consensus is expensive
• scientific article; zbMATH DE number 6297761

Cited in

(20)

• Are Byzantine failures really different from crash failures?
• Crash-tolerant consensus in directed graph revisited (extended abstract)
• Communication-efficient randomized consensus
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results
• Communication complexity of consensus in anonymous message passing systems
• Error-free multi-valued consensus with Byzantine failures
• A crash-tolerant consensus algorithm in presence of probabilistic message omission
• The cost of fault tolerance in multi-party communication complexity
• Time and Communication Efficient Consensus for Crash Failures
• Scalable Quantum Consensus for Crash Failures
• Fast deterministic consensus in a noisy environment
• Early-deciding consensus is expensive
• Fault-tolerant graph realizations in the congested clique
• Reaching consensus in the presence of contention-related crash failures
• Brief Announcement: Improved Consensus in Quantum Networks
• Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
• Fast agreement in networks with Byzantine nodes
• Synchronous t-resilient consensus in arbitrary graphs
• Distributed fast crash-tolerant consensus with nearly-linear quantum communication
• Adaptive timeliness of consensus in presence of crash and timing faults

This page was built for publication: Fast scalable deterministic consensus for crash failures

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