Issue No. 08 - August (2009 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.167
Anders Gidenstam , Max Planck Institute for Computer Science, Saarbrücken
Marina Papatriantafilou , Chalmers University of Technology, Göteborg
Håkan Sundell , University College of Borås, Borås
Philippas Tsigas , Chalmers University of Technology, Göteborg
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.
Memory management, memory reclamation, semiautomatic, garbage collection, data structures, lock-free, shared memory.
Anders Gidenstam, Marina Papatriantafilou, Håkan Sundell, Philippas Tsigas, "Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting", IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 1173-1187, August 2009, doi:10.1109/TPDS.2008.167