A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling
From MaRDI portal
Publication:3460730
DOI10.1007/978-3-319-25258-2_27zbMath1472.68014OpenAlexW2294310578MaRDI QIDQ3460730
Sam Toueg, Hugues Fauconnier, Carole Delporte-Gallet
Publication date: 8 January 2016
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-25258-2_27
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- The disagreement power of an adversary
- Adaptive progress: a gracefully-degrading liveness property
- Anti-\(\Omega \): the weakest failure detector for set agreement
- Partial synchrony based on set timeliness
- The topological structure of asynchronous computability
- The Iterated Restricted Immediate Snapshot Model
- Tight failure detection bounds on atomic object implementations
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Unreliable failure detectors for reliable distributed systems
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- The weakest failure detector for solving k-set agreement
- Generalized FLP impossibility result for t-resilient asynchronous computations