A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Lock-Free Parallel Garbage Collection
[chapter]
2005
Lecture Notes in Computer Science
This paper presents a lock-free parallel algorithm for garbage collection in a realistic model using synchronization primitives offered by machine architectures. Mutators and collectors can simultaneously operate on the data structure. In particular no strict alternation between usage and cleaning up is necessary, contrary to what is common in most other garbage collection algorithms. We first design and prove an algorithm with a coarse grain of atomicity and subsequently apply the reduction
doi:10.1007/11576235_31
fatcat:ptizfikfkfhrbkajlzx5aj4qcq