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 theorem developed in [11] to implement the higher-level atomic steps by means of the low-level primitives. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Gao, H., Groote, J. F., & Hesselink, W. H. (2005). Lock-free parallel garbage collection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3758 LNCS, pp. 263–274). Springer Verlag. https://doi.org/10.1007/11576235_31
Mendeley helps you to discover research relevant for your work.