Performance of memory reclamation for lockless synchronization

DOI10.1016/J.JPDC.2007.04.010zbMATH Open1243.68109OpenAlexW3022040810WikidataQ56211927 ScholiaQ56211927MaRDI QIDQ436632FDOQ436632

Angela Demke Brown, Jonathan Walpole, Paul E. Mckenney, Thomas E. Hart

Publication date: 25 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.04.010

zbMATH Keywords

performancesynchronizationconcurrencyhazard pointerslocklessmemory reclamationnon-blockingread-copy update

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cited In (5)

• Reuse, don't recycle: transforming lock-free algorithms that throw away descriptors
• Non-blocking Patricia tries with replace operations
• Recency-Abstraction for Heap-Allocated Storage
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner
• Parallel implementations of Brunotte's algorithm

   Recommendations

• Characterizing the performance of algorithms for lock-free objects 👍 👎
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes 👍 👎
• Performance issues in non-blocking synchronization on shared-memory multiprocessors 👍 👎
• The Synchronization Power of Coalesced Memory Accesses 👍 👎
• Algorithms – ESA 2005 👍 👎

This page was built for publication: Performance of memory reclamation for lockless synchronization

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