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

DOI10.1007/PL00008920zbMATH Open1448.68141OpenAlexW2120152386MaRDI QIDQ5137906FDOQ5137906

Authors: W. K. Lo, Vassos Hadzilacos 

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

Recommendations

• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• The gap in circumventing the impossibility of consensus
• Failure detectors as type boosters
• Determining Consensus Numbers
• Space-efficient asynchronous consensus without shared memory initialization

zbMATH Keywords

consensusdistributed algorithmsfault-toleranceshared objects

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• Objects shared by Byzantine processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the power of breakable objects
• Hundreds of impossibility results for distributed computing
• Failure detectors as type boosters
• The gap in circumventing the impossibility of consensus
• Resilient consensus for infinitely many processes. (Extended abstract)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137906)