Authors: Norbert Podhorszki
Addresses: Center for Computational Sciences, Oak Ridge National Laboratory, One Bethel Valley Road, P.O. Box 2008, MS-6008, USA
Abstract: The multi-phase copying garbage collection was designed to avoid the need for large amount of reserved memory usually required for the copying types of garbage collection algorithms. The collection is performed in multiple phases using the available free memory. This paper proves that the number of phases depends on the size of the reserved memory and the ratio of the garbage and accessible objects. The performance of the implemented algorithm is tested in a fine-grained parallel Prolog system. We find that reserving only 10% of memory for garbage collection is sufficient for good performance in practice. Additionally, an improvement of the generic algorithm specifically for the tested parallel Prolog system is described.
Keywords: multi-phase copying; garbage collection algorithms; logic programming; reserved memory; parallel Prolog.
International Journal of Computational Science and Engineering, 2009 Vol.4 No.3, pp.204 - 212
Published online: 21 Jul 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article