Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
DOI10.1007/978-3-319-03578-9_25zbMath1406.68010OpenAlexW1926169981MaRDI QIDQ2868653
Publication date: 17 December 2013
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03578-9_25
reductionfault tolerancedistributed computingquorumasynchronous systemwait-freedom\(k\)-set agreementdistributed computabilityfailure detectormessage-passing systemsimultaneous consensus
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Cites Work
- Unnamed Item
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
- On set consensus numbers
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- The \(k\)-simultaneous consensus problem
- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
- Anti-Ω
- The topological structure of asynchronous computability
- Concurrent Programming: Algorithms, Principles, and Foundations
- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
- The Weakest Failure Detector for Message Passing Set-Agreement
- Tight failure detection bounds on atomic object implementations
- Sharing memory robustly in message-passing systems
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- k-set agreement with limited accuracy failure detectors
- Generalized FLP impossibility result for t-resilient asynchronous computations
This page was built for publication: Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
