Reuse, don't recycle: transforming lock-free algorithms that throw away descriptors

DOI10.4230/LIPICS.DISC.2017.4MaRDI QIDQ6487476zbMATH OpenFDO

Authors Maya Arbel-Raviv, Trevor Brown

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2017.4

zbMATH Keywords

concurrencydata structuresdescriptorslock-freesynchronization

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Characterizing the performance of algorithms for lock-free objects
• Performance of memory reclamation for lockless synchronization
• A scalable lock-free stack algorithm
• Trace-based derivation of a scalable lock-free stack algorithm
• scientific article; zbMATH DE number 2013841
• A Transformation to Provide Deadlock-Free Programs
• How lock-free data structures perform in dynamic environments: models and analyses

Cited in

(2)

• Non-blocking Patricia tries with replace operations
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes

This page was built for publication: Reuse, don't recycle: transforming lock-free algorithms that throw away descriptors

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