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

DOI10.1007/S00453-008-9268-XzbMATH Open1204.68044DBLPjournals/algorithmica/GidenstamPT10OpenAlexW2011780410WikidataQ57583945 ScholiaQ57583945MaRDI QIDQ5961972FDOQ5961972

Marina Papatriantafilou, Philippas Tsigas, Anders Gidenstam

Publication date: 16 September 2010

Published in: Algorithmica (Search for Journal in Brave)

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

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

zbMATH Keywords

memory allocationnon-blocking synchronizationmultithreaded applicationslock-free synchronization

Mathematics Subject Classification ID

Computer system organization (68M99)

Cites Work

• Scheduling multithreaded computations by work stealing
• 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?)
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
• Lock-free linked lists using compare-and-swap
• Algorithms – ESA 2005
• Self-stabilization of wait-free shared memory objects
• Fast and lock-free concurrent priority queues for multi-thread systems

Cited In (3)

• Of Concurrent Data Structures and Iterations
• Algorithms – ESA 2005
• Table space designs for implicit and explicit concurrent tabled evaluation

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)