BibTeX
@MISC{Groningen95optimizingmark-scan,
author = {John H.G. van Groningen},
title = {Optimizing Mark-Scan Garbage Collection},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a mark-scan garbage collection algorithm for variablesized nodes that marks the accessible nodes and compacts the heap only when memory becomes fragmented. For many lazy functional programs, this garbage collector performs much better than a combination of a copying and two-phase compacting mark-scan collector.
Citations
| 234 | A Real-Time Garbage Collector Based on the Lifetime of Objects - Lieberman, Hewitt - 1983 |
| 215 | A nonrecursive list compacting algorithm - Cheney - 1970 |
| 61 | An Efficient Machine-Independant Procedure for Garbage Collection in Various List Structures - Schorr - 1967 |
| 38 | Comparing mark-and-sweep and stop-and-copy garbage collection - Zorn - 1990 |
| 33 | Benchmarking implementations of lazy functional languages - Hartel, Langendoen - 1993 |
| 23 | Generating efficient code for lazy functional languages - Smesters, Nocker, et al. - 1991 |
| 20 | Generational garbage collection for haskell - Sansom, Jones - 1993 |
| 17 | A fast garbage compaction algorithm - Jonkers - 1979 |
| 8 | Dual-mode garbage collection - Sansom - 1991 |
| 4 | An efficient garbage compaction algorithm - Martin - 1982 |
| 3 | Efficient Heap Management in the Concrete ABC Machine - Groningen, Ncker, et al. - 1991 |
| 1 | Another compacting garbage collector - Morris - 1982 |
