Determining Consensus Numbers

DOI10.1137/S0097539797329439MaRDI QIDQ4507388zbMATH OpenFDO

Authors Eric Ruppert

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539797329439

zbMATH Keywords

asynchronousconsensusconsensus hierarchydistributed computingread-modify-writereadablerobustshared memorywait-free

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• Generic proofs of consensus numbers for abstract data types
• On the viability of the deterministic consensus hierarchy
• scientific article; zbMATH DE number 7561269
• N-Consensus is the Second Strongest Object for N + 1 Processes
• Condition-based consensus solvability: a hierarchy of conditions and efficient protocols

Cited in

(27)

• Failure detectors as type boosters
• The computational structure of progress conditions and shared objects
• A complexity-based classification for multiprocessor synchronization
• The consensus number of a cryptocurrency
• On the viability of the deterministic consensus hierarchy
• A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
• Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects
• On the power of breakable objects
• Solvability of Consensus: Composition Breaks Down for NonDeterministic Types
• Robust wait-free hierarchies
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• scientific article; zbMATH DE number 1559573 (Why is no real title available?)
• A simple object that spans the whole consensus hierarchy
• On the use of registers in achieving wait-free consensus
• On the power of shared object types to implement one-resilient consensus
• Hundreds of impossibility results for distributed computing
• On deterministic abortable objects
• An informal visit to the wonderful land of consensus numbers and beyond
• Deterministic objects: life beyond consensus
• Generic proofs of consensus numbers for abstract data types
• N-Consensus is the Second Strongest Object for N + 1 Processes
• On the locality of consistency conditions
• Multi-writer consistency conditions for shared memory objects
• On the robustness of h^r_m (preliminary version)
• When is recoverable consensus harder than consensus?
• Determining recoverable consensus numbers
• The gap in circumventing the impossibility of consensus

This page was built for publication: Determining Consensus Numbers

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