A hierarchy of conditions for consensus solvability

DOI10.1145/383962.384006zbMath1333.68282MaRDI 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

snapshot; fault-tolerance; consensus; asynchronous shared memory; step complexity

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

68W15: Distributed algorithms

Related Items

Condition-based consensus solvability: a hierarchy of conditions and efficient protocols