The Community for Technology Leaders
Parallel Architectures, Algorithms, and Networks, International Symposium on (2005)
Las Vegas, Nevada, USA
Dec. 7, 2005 to Dec. 9, 2005
ISSN: 1087-4089
ISBN: 0-7695-2509-1
pp: 202-207
Hakan Sundell , Chalmers University of Technology and Goteborg University, Sweden
Marina Papatriantafilou , Chalmers University of Technology and Goteborg University, Sweden
Philippas Tsigas , Chalmers University of Technology and Goteborg University, Sweden
Anders Gidenstam , Chalmers University of Technology and Goteborg University, Sweden
ABSTRACT
We present an efficient and practical lock-free implementation of a memory reclamation scheme based on reference counting, aimed for use with arbitrary lock-free dynamic data structures. The scheme guarantees the safety of local as well as global references, supports arbitrary memory reuse, uses atomic primitives which are available in modern computer systems and provides an upper bound on the memory prevented for reuse. To the best of our knowledge, this is the first lock-free algorithm that provides all of these properties. Experimental results indicate significant performance improvements for lock-free algorithms of dynamic data structures that require strong garbage collection support.
INDEX TERMS
null
CITATION
Hakan Sundell, Marina Papatriantafilou, Philippas Tsigas, Anders Gidenstam, "Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting", Parallel Architectures, Algorithms, and Networks, International Symposium on, vol. 00, no. , pp. 202-207, 2005, doi:10.1109/ISPAN.2005.42
98 ms
(Ver 3.3 (11022016))