A general lock-free algorithm using compare-and-swap

DOI10.1016/J.IC.2006.10.003zbMATH Open1107.68119OpenAlexW1999719510MaRDI QIDQ865625

W. H. Hesselink, Hui Gao

Publication date: 20 February 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/2807412/2007InfCompGao.pdf

zbMATH Keywords

correctnessatomicitylock-freecompare-and-swaprefinement mapping

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• The existence of refinement mappings
• Lock-free parallel and concurrent garbage collection by mark\&sweep
• Lock-free dynamic hash tables with open addressing
• Nonblocking \(k\)-compare-single-swap
• Efficient and practical constructions of LL/SC variables
• Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
• Computer Aided Verification
• Universal constructions for multi-object operations
• Practical implementations of non-blocking synchronization primitives
• Split-ordered lists

Related Items (4)

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ A scalable lock-free stack algorithm ⋮ Simulation Refinement for Concurrency Verification ⋮ A general technique for proving lock-freedom

Uses Software

• PVS

This page was built for publication: A general lock-free algorithm using compare-and-swap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865625)