Software—Practice & Experience
Garbage collection can be faster than stack allocation
Information Processing Letters
Garbage collection in an uncooperative environment
Software—Practice & Experience
Real-time concurrent collection on stock multiprocessors
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Empirical analysis of a LISP system
Empirical analysis of a LISP system
Simple generational garbage collection and fast allocation
Software—Practice & Experience
Real-time garbage collection on general-purpose machines
Journal of Systems and Software
Comparing mark-and sweep and stop-and-copy garbage collection
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Tag-free garbage collection for strongly typed programming languages
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
An adaptive tenuring policy for generation scavengers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using key object opportunism to collect old objects
OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
The treadmill: real-time garbage collection without motion sickness
ACM SIGPLAN Notices
Space efficient conservative garbage collection
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Tag-free garbage collection using explicit type parameters
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Garbage collection for strongly-typed languages using run-time type reconstruction
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Comparison of Compacting Algorithms for Garbage Collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
A real-time garbage collector based on the lifetimes of objects
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
A nonrecursive list compacting algorithm
Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems
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
On-the-fly Global Garbage Collection Based on Partly Mark-Sweep
IWMM '95 Proceedings of the International Workshop on Memory Management
Some practical methods for rapid combinator reduction
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
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.24 |
We demonstrate the benefits of a garbage collection technique that requires neither programmer assistance nor rebuilding (compiling or linking) of target applications. That is, our approach effectively mitigates performance degeneration due to memory leaks in applications when the source and object code are unavailable. Our technique is an extension of the garbage collection method known as conservative garbage collection. We refer to our approach as autonomous garbage collection. Autonomous garbage collection is especially useful for long running server applications in large-scale information processing server environments. Our prototype demonstrates that this garbage collection technique is feasible. Our experimental results show that this technique is more general and easier to use than many of the previous garbage collection proposals targeted at resolving memory leaks in non-cooperative server applications.