Garbage Collection Can Be Faster Than Stack Allocation (1987) [101 citations — 14 self]
Download:
http://http.cs.berkeley.edu/~fateman/264/papers/gc
http://www.cs.princeton.edu/faculty/appel/papers/4
DBLP
CACHED:
|
http://http.cs.berkeley.edu/~fateman/264/papers/gc
http://www.cs.princeton.edu/faculty/appel/papers/4
DBLP
CACHED:
|
by
Andrew W. Appel
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Appel87garbagecollection,
author = {Andrew W. Appel},
title = {Garbage Collection Can Be Faster Than Stack Allocation},
year = {1987}
}
author = {Andrew W. Appel},
title = {Garbage Collection Can Be Faster Than Stack Allocation},
year = {1987}
}
Bookmarks
OpenURL
Abstract:
A very old and simple algorithm for garbage collection gives very good results when the physical memory is much larger than the number of reachable cells. In fact, the overhead associated with allocating and collecting cells from the heap can be reduced to less than one instruction per cell by increasing the size of physical memory. Special hardware, intricate garbage-collection algorithms, and fancy compiler analysis become unnecessary.
Citations
| 1416 | The Definition of Standard ML – Milner, Tofte, et al. - 1990 |
| 249 | Recursive functions of symbolic expressions and their computation by machine – MCCARTHY - 1960 |
| 217 | A real-time garbage collector based on the lifetimes of objects – Lieberman, Hewitt - 1983 |
| 196 | List processing in real time on a serial computer – Baker - 1978 |
| 128 | Garbage collection in large lisp systems – Moon - 1984 |
| 99 | A method for overlapping and erasure of lists – Collins - 1960 |
| 74 | A LISP garbage-collector for virtual-memory computer systems – FENICHEL, YOCHELSON - 1969 |
| 4 | Rabbit: a compiler for Scheme," AI-TR-474 – Steele - 1978 |
