Wait-free computing
From MaRDI portal
Recommendations
Cites work
- A combinatorial characterization of the distributed 1-solvable tasks
- A gap theorem for consensus types extended abstract
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- Concurrent reading and writing
- Consensus power makes (some) sense! (extended abstract)
- Converting Lamport's regular register to atomic register
- Generalized FLP impossibility result for t-resilient asynchronous computations
- How to share concurrent wait-free variables
- scientific article; zbMATH DE number 4082934 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- More on t-resilience vs. wait-freedom (extended abstract)
- On interprocess communication. I: Basic formalism
- On the minimal synchronism needed for distributed consensus
- On the robustness of Herlihy's hierarchy
- On the use of registers in achieving wait-free consensus
- Optimal multi-writer multi-reader atomic register
- Resource bounds and combinations of consensus objects
- Set consensus using arbitrary objects (preliminary version)
- Sharing memory robustly in message-passing systems
- Solvability of Consensus: Composition Breaks Down for NonDeterministic Types
- The asynchronous computability theorem for t-resilient tasks
- The elusive atomic register
- Wait-free k-set agreement is impossible
- Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
This page was built for publication: Wait-free computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062513)
