Nonblocking \(k\)-compare-single-swap

DOI10.1007/s00224-008-9155-5zbMath1179.68044OpenAlexW2001021638MaRDI QIDQ2272205

Mark Moir, Nir Shavit, Victor Luchangco

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9155-5

zbMATH Keywords

synchronizationshared memory multiprocessorscompare-and-swap

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Shared-object system equilibria: delay and throughput analysis, A general lock-free algorithm using compare-and-swap, A single-version STM that is multi-versioned permissive

Cites Work

• Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
• DCAS-based concurrent deques
• Forward and backward simulations. I. Untimed Systems
• Universal operations
• Atomic snapshots of shared memory
• Randomized wait-free concurrent objects (extended abstract)
• Disjoint-access-parallel implementations of strong shared memory primitives
• Practical implementations of non-blocking synchronization primitives
• Unnamed Item
• Unnamed Item
• Unnamed Item