Nonblocking k-compare-single-swap

DOI10.1007/S00224-008-9155-5zbMATH Open1179.68044OpenAlexW2001021638MaRDI QIDQ2272205FDOQ2272205

Authors: Victor Luchangco, Mark Moir, Nir Shavit 

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

Recommendations

• scientific article; zbMATH DE number 2013836
• Pragmatic primitives for non-blocking data structures
• scientific article; zbMATH DE number 2006660
• Publication:2766861
• Highly-Concurrent Multi-word Synchronization

zbMATH Keywords

synchronizationcompare-and-swapshared memory multiprocessors

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

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

Cited In (8)

• A single-version STM that is multi-versioned permissive
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shared-object system equilibria: delay and throughput analysis
• Highly-Concurrent Multi-word Synchronization
• Highly concurrent multi-word synchronization
• Pragmatic primitives for non-blocking data structures
• 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)