Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
An empirical study of list structure in Lisp
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
Multiprocessing compactifying garbage collection
Communications of the ACM
A nonrecursive list compacting algorithm
Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Garbage collection in a large LISP system
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Architecture of SOAR: Smalltalk on a RISC
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Compacting garbage collection with ambiguous roots
ACM SIGPLAN Lisp Pointers
| Hi-index | 0.00 |
Many readers of this article have heard the term "garbage collection" on occasion without being given much explanation as to what it is. One purpose of this paper, therefore, is to describe what garbage collection is and why it is a subject of concern for computing in general and symbolic computing in particular. The first section briefly describes garbage collection. The next section gives a general description of what has come to be known as the "classical" garbage collection algorithms. A few of the classical algorithms' shortcomings for use in today's systems are described in the next section. This is followed by a section on a few techniques in garbage collection which address the needs of today's and tomorrow's symbolic computing systems.