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
Analysis of an algorithm for real time garbage collection
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
The Incremental Garbage Collection of Processes
The Incremental Garbage Collection of Processes
Incremental incrementally compacting garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Distributed garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Atomic garbage collection: managing a stable heap
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Distributed copying garbage collection
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
| Hi-index | 0.00 |
This paper describes a real-time garbage collection algorithm for list processing systems. We identify two efficiency problems inherent to real-time garbage collectors, and give some evidence that the proposed algorithm tends to reduce these problems. In a virtual memory implementation, the algorithm restructures the cell storage area more compactly, thus reducing working sets. The algorithm also may provide a more garbage-free storage area at the end of the collection cycle, although this claim really must await empirical verification.