RT Journal Article
JF IEEE Transactions on Parallel & Distributed Systems
YR 2008
VO 20
IS
SP 1173
TI Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
A1 Marina Papatriantafilou,
A1 Philippas Tsigas,
A1 Anders Gidenstam,
A1 Håkan Sundell,
K1 Memory management
K1 memory reclamation
K1 semiautomatic
K1 garbage collection
K1 data structures
K1 lock-free
K1 shared memory.
AB We present an efficient and practical lock-free method for semiautomatic (application-guided) memory reclamation based on reference counting, aimed for use with arbitrary lock-free dynamic data structures. The method guarantees the safety of local as well as global references, supports arbitrary memory reuse, uses atomic primitives that are available in modern computer systems, and provides an upper bound on the amount of memory waiting to be reclaimed. To the best of our knowledge, this is the first lock-free method that provides all of these properties. We provide analytical and experimental study of the method. The experiments conducted have shown that the method can also provide significant performance improvements for lock-free algorithms of dynamic data structures that require strong memory management.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1045-9219
LA English
DO 10.1109/TPDS.2008.167
LK http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.167