NB{\texttt{malloc}}: Allocating memory in a lock-free manner

DOI10.1007/S00453-008-9268-XMaRDI QIDQ5961972zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas

Publication date 16 September 2010

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-008-9268-x

zbMATH Keywords

memory allocationnon-blocking synchronizationmultithreaded applicationslock-free synchronization

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• Algorithms – ESA 2005
• Lock-free reference counting
• Performance of memory reclamation for lockless synchronization
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes

Cites work

• scientific article; zbMATH DE number 2006660 (Why is no real title available?)
• scientific article; zbMATH DE number 2013841 (Why is no real title available?)
• Algorithms – ESA 2005
• Fast and lock-free concurrent priority queues for multi-thread systems
• Lock-free linked lists using compare-and-swap
• Practical implementations of non-blocking synchronization primitives
• Randomized wait-free concurrent objects (extended abstract)
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
• Scheduling multithreaded computations by work stealing
• Self-stabilization of wait-free shared memory objects

Cited in

(3)

• Algorithms – ESA 2005
• Table space designs for implicit and explicit concurrent tabled evaluation
• Of concurrent data structures and iterations

Describes a project that uses

Uses Software

• STL

This page was built for publication: NB{\texttt{malloc}}: Allocating memory in a lock-free manner

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