Replication-based incremental copying collection

13Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce a new replication-based copying garbage collection technique. We have implemented one simple variation of this method to provide incremental garbage collection on stock hardware with no special operating system or virtual memory support. The performance of the prototype implementation is excellent: major garbage collection pauses are completely eliminated with only a slight increase in minor collection pause times. Unlike the standard copying algorithm, the replication-based method does not destroy the original replica when a copy is created. Instead, multiple copies may exist, and various standard strategies for maintaining consistency may be applied. In our implementation for Standard ML of New Jersey, the mutator continues to use the from-space replicas until the collector has achieved a consistent replica of all live data in to-space. We present a design for a concurrent garbage collector using the replication-based technique. We also expect replication-based ge methods to be useful in providing services for persistence and distribution, and briefly discuss these possibilities.

Cite

CITATION STYLE

APA

Nettles, S., O’Toole, J., Pierce, D., & Haines, N. (1992). Replication-based incremental copying collection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 637 LNCS, pp. 357–364). Springer Verlag. https://doi.org/10.1007/bfb0017201

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free