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

DOI10.1007/s00453-008-9268-xzbMath1204.68044DBLPjournals/algorithmica/GidenstamPT10OpenAlexW2011780410WikidataQ57583945 ScholiaQ57583945MaRDI QIDQ5961972

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

zbMATH Keywords

lock-free synchronizationmemory allocationmultithreaded applicationsnon-blocking synchronization

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (2)

Of Concurrent Data Structures and Iterations ⋮ Table space designs for implicit and explicit concurrent tabled evaluation

Uses Software

• STL

Cites Work

• Unnamed Item
• Unnamed Item
• Self-stabilization of wait-free shared memory objects
• Fast and lock-free concurrent priority queues for multi-thread systems
• Scheduling multithreaded computations by work stealing
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
• Randomized wait-free concurrent objects (extended abstract)
• Lock-free linked lists using compare-and-swap
• Practical implementations of non-blocking synchronization primitives
• Algorithms – ESA 2005

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