Byzantine disk paxos

DOI10.1145/1011767.1011801zbMath1321.68452OpenAlexW2144731545MaRDI QIDQ5501502

Ittai Abraham, Idit Keidar, Gregory Chockler, Dahlia Malkhi

Publication date: 3 August 2015

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

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

zbMATH Keywords

consensusshared-memory emulationsByzantine failurestermination conditions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

On the cost of uniform protocols whose memory consumption is adaptive to interval contention

This page was built for publication: Byzantine disk paxos