Performance and evaluation of LISP systems
Performance and evaluation of LISP systems
Revised report on the algorithmic language scheme
ACM SIGPLAN Notices
The Mahler experience: using an intermediate language as the machine description
ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
The implementation of PC Scheme
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Overview of garbage collection in symbolic computing
ACM SIGPLAN Lisp Pointers
On the Usefulness of Liveness for Garbage Collection and Leak Detection
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Garbage collection in the next C++ standard
Proceedings of the 2009 international symposium on Memory management
An efficient non-moving garbage collector for functional languages
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Autonomous garbage collection: resolving memory leaks in long-running server applications
Computer Communications
| Hi-index | 0.00 |
Many modern garbage collectors [4] recover space by copying. Using an initial "root" set of pointers which are stored in known locations, all accessible objects are copied into a "new space". Two of the attractive properties of such a collector are that it results in memory compaction and it can have a running time proportional to the amount of accessible storage [2]. However, such schemes place a large burden on the underlying system as all pointers to the objects must be found and changed.