Nonblocking k-compare-single-swap
From MaRDI portal
Publication:2272205
Recommendations
Cites work
- A practical multi-word compare-and-swap operation
- A pragmatic implementation of non-blocking linked-lists
- Atomic snapshots of shared memory
- DCAS-based concurrent deques
- Disjoint-access-parallel implementations of strong shared memory primitives
- Forward and backward simulations. I. Untimed Systems
- Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
- Practical implementations of non-blocking synchronization primitives
- Randomized wait-free concurrent objects (extended abstract)
- The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures
- Universal operations
Cited in
(8)- Shared-object system equilibria: delay and throughput analysis
- A pragmatic implementation of non-blocking linked-lists
- A practical multi-word compare-and-swap operation
- Pragmatic primitives for non-blocking data structures
- Highly-Concurrent Multi-word Synchronization
- Highly concurrent multi-word synchronization
- A single-version STM that is multi-versioned permissive
- A general lock-free algorithm using compare-and-swap
This page was built for publication: Nonblocking \(k\)-compare-single-swap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272205)