Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

Authors:
Anders Gidenstam;Marina Papatriantafilou;Hakan Sundell;Philippas Tsigas
Affiliations:
Max Planck Institute for Computer Science, Saarbrücken;Chalmers University of Technology, Göteborg;University College of Borås, Borås;Chalmers University of Technology, Göteborg
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2009

Citing 0
Cited 4

Cache-aware lock-free queues for multiple producers/consumers and weak memory consistency

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Efficient lock free privatization

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A lock-free algorithm for concurrent bags

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Drop the anchor: lightweight memory management for non-blocking data structures

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.