Wait-free computing
From MaRDI portal
Publication:6062513
DOI10.1007/bfb0022136zbMath1524.68145MaRDI QIDQ6062513
Publication date: 1 December 2023
Published in: Distributed Algorithms (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- On interprocess communication. I: Basic formalism
- Converting Lamport's regular register to atomic register
- A combinatorial characterization of the distributed 1-solvable tasks
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- Concurrent reading and writing
- Solvability of Consensus: Composition Breaks Down for NonDeterministic Types
- The elusive atomic register
- Sharing memory robustly in message-passing systems
- How to share concurrent wait-free variables
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- The asynchronous computability theorem for t-resilient tasks
- Optimal multi-writer multi-reader atomic register
- Resource bounds and combinations of consensus objects
- On the robustness of Herlihy's hierarchy
- Set consensus using arbitrary objects (preliminary version)
- Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
- A gap theorem for consensus types extended abstract
- On the use of registers in achieving wait-free consensus
- Consensus power makes (some) sense! (extended abstract)
- More on t-resilience vs. wait-freedom (extended abstract)
This page was built for publication: Wait-free computing
