Fast scalable deterministic consensus for crash failures

DOI10.1145/1582716.1582738zbMath1291.68071OpenAlexW2037610055MaRDI QIDQ5170308

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

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

synchronyscalabilityfault tolerancemessage passingconsensusgraph expansionbit communication complexity

Mathematics Subject Classification ID

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

Related Items (5)

The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Brief Announcement: Improved Consensus in Quantum Networks ⋮ Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication ⋮ Communication-efficient randomized consensus

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