The \(k\)-simultaneous consensus problem
From MaRDI portal
Publication:2377137
DOI10.1007/s00446-009-0090-8zbMath1267.68054OpenAlexW2094648797MaRDI QIDQ2377137
Yehuda Afek, Eli Gafni, Michel Raynal, Sergio Rajsbaum, Corentin Travers
Publication date: 28 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-009-0090-8
consensusdistributed computabilityprocess crashset agreementasynchronous shared memory systemsbinary vs multivalued agreementwait-free construction
Related Items
Unnamed Item, Distributed universality, Power and limits of distributed computing shared memory models, Anti-\(\Omega \): the weakest failure detector for set agreement, Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects, Generalized Universality, Oblivious Collaboration, Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
Cites Work
- Unnamed Item
- Unnamed Item
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- On interprocess communication. I: Basic formalism
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- The concurrency hierarchy, and algorithms for unbounded concurrency
- Anti-Ω
- The topological structure of asynchronous computability
- Early stopping in Byzantine agreement
- The Committee Decision Problem
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots of shared memory
- Sharing memory robustly in message-passing systems
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Randomized wait-free concurrent objects (extended abstract)
- Distributed Computing