DMCA
Lock-free parallel garbage collection (2005)
| Venue: | DONGARRA (EDS.), PROCEEDINGS OF THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, ISPA’05, IN: LNCS |
| Citations: | 3 - 2 self |
BibTeX
@INPROCEEDINGS{Gao05lock-freeparallel,
author = {H. Gao and J. F. Groote and W. H. Hesselink},
title = {Lock-free parallel garbage collection },
booktitle = {DONGARRA (EDS.), PROCEEDINGS OF THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, ISPA’05, IN: LNCS},
year = {2005},
pages = {263--274},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
lock-free parallel garbage collection data structure coarse grain lock-free parallel algorithm realistic model strict alternation synchronization primitive low-level primitive garbage collection algorithm machine architecture reduction theorem first design higher-level atomic step garbage collection
