Practical and Efficient Lock-Free Garbage Collection Based on Reference Counting
Rapport, 2005

We present an efficient and practical lock-free implementation of a garbage collection scheme based on reference counting aimed for the 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 data structures that require strong garbage collection.

lock-free

shared memory

reference counting

garbage collection

Författare

Anders Gidenstam

Chalmers, Data- och informationsteknik, Datavetenskap, Datavetenskap, Datakommunikation och distribuerade system (Chalmers)

Marina Papatriantafilou

Chalmers, Data- och informationsteknik, Datavetenskap, Datavetenskap, Datakommunikation och distribuerade system (Chalmers)

Håkan Sundell

Chalmers, Data- och informationsteknik, Datavetenskap, Datavetenskap, Datakommunikation och distribuerade system (Chalmers)

Philippas Tsigas

Chalmers, Data- och informationsteknik, Datavetenskap, Datavetenskap, Datakommunikation och distribuerade system (Chalmers)

Ämneskategorier

Data- och informationsvetenskap

Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 2005-04

Mer information

Skapat

2017-10-06