On the power of shared object types to implement one-resilient Consensus

DOI10.1007/PL00008920zbMath1448.68141OpenAlexW2120152386MaRDI QIDQ5137906

Vassos Hadzilacos, Wai-Kau Lo

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00008920

zbMATH Keywords

fault-tolerancedistributed algorithmsconsensusshared objects

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

Hundreds of impossibility results for distributed computing

Cites Work

• Impossibility of distributed consensus with one faulty process
• Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
• More on t-resilience vs. wait-freedom (extended abstract)
• The mutual exclusion problem

This page was built for publication: On the power of shared object types to implement one-resilient Consensus