A hierarchy of conditions for consensus solvability

DOI10.1145/383962.384006zbMath1333.68282OpenAlexW2015699128MaRDI QIDQ2787677

Matthieu Roy, Michel Raynal, Achour Mostefaoui, Sergio Rajsbaum

Publication date: 4 March 2016

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

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

zbMATH Keywords

snapshotfault-toleranceconsensusasynchronous shared memorystep complexity

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (2)

On the Validity of Consensus ⋮ Condition-based consensus solvability: a hierarchy of conditions and efficient protocols

This page was built for publication: A hierarchy of conditions for consensus solvability