Issue No. 09 - September (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.243529
<p>A parallel copying garbage collection algorithm for symbolic languages executing on shared-memory multiprocessors is proposed. The algorithm is an extension of Baker's sequential algorithm with a novel method of heap allocation to prevent fragmentation and facilitate load distribution during garbage collection. An implementation of the algorithm within a concurrent logic programming system, VPIM, has been evaluated and the results, for a wide selection of benchmarks, are analyzed here. The authors show 1) how much the algorithm reduces the contention for critical sections during garbage collection, 2) how well the load-balancing strategy works and its expected overheads, and 3) the expected speedup achieved by the algorithm.</p>
Index Termsparallel copying; garbage collection; shared-memory multiprocessor; symbolic languages; heap allocation; fragmentation; load distribution; concurrent logic programming system; VPIM; contention; load-balancing; logic programming; parallel algorithms; resource allocation; shared memory systems; storage management
E. Tick and A. Imai, "Evaluation of Parallel Copying Garbage Collection on a Shared-Memory Multiprocessor," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1030-1040, 1993.