N-Consensus is the Second Strongest Object for N + 1 Processes

DOI10.1007/978-3-540-77096-1_19MaRDI QIDQ5386256zbMATH OpenOpenAlexFDO

Authors Eli Gafni, Petr Kuznetsov

Publication date 22 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77096-1_19

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Determining Consensus Numbers
• The gap in circumventing the impossibility of consensus
• \(m\)-consensus objects are pretty powerful
• On the viability of the deterministic consensus hierarchy
• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus

Cited in

(10)

• The power of multiobjects.
• \(m\)-consensus objects are pretty powerful
• A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
• On the power of breakable objects
• Determining Consensus Numbers
• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• On deterministic abortable objects
• An informal visit to the wonderful land of consensus numbers and beyond
• Resilient consensus for infinitely many processes. (Extended abstract)
• On the complexity of basic abstractions to implement consensus

This page was built for publication: N-Consensus is the Second Strongest Object for N + 1 Processes

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