Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
From MaRDI portal
Publication:6099028
Cites work
- scientific article; zbMATH DE number 6876104 (Why is no real title available?)
- scientific article; zbMATH DE number 7561456 (Why is no real title available?)
- A Single-Enqueuer Wait-Free Queue Implementation
- A completeness theorem for a class of synchronization objects
- A scalable lock-free stack algorithm
- Atomic snapshots of shared memory
- Atomic snapshots using lattice agreement
- Common2 extended to stacks and unbounded concurrency
- Concurrent programming: algorithms, principles, and foundations.
- Distributed Computing
- Help when needed, but no more: efficient read/write partial snapshot
- Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated
- Limited-use atomic snapshots with polylogarithmic step complexity
- Local linearizability for concurrent container-type data structures
- Modular verification of concurrency-aware linearizability
- Nontrivial and universal helping for wait-free queues and stacks
- On interprocess communication. I: Basic formalism
- On the inherent sequentiality of concurrent objects
- Quantitative relaxation of concurrent data structures
- Relaxed data types as consistency conditions
- The complexity of obstruction-free implementations
- The computability of relaxed data structures: queues and stacks as examples
- Unifying Concurrent Objects and Distributed Tasks
This page was built for publication: Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6099028)
