Bounded-latency regional garbage collection

Authors:
Felix S. Klock, II;William D. Clinger
Affiliations:
Adobe Systems Incorporated, Waltham, MA, USA;Northeastern University, Boston, MA, USA
Venue:
Proceedings of the 7th symposium on Dynamic languages
Year:
2011

Citing 34
Cited 0

Real-time concurrent collection on stock multiprocessors

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Real-time garbage collection on general-purpose machines

Journal of Systems and Software
Representing control in the presence of first-class continuations

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Mostly parallel garbage collection

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
The treadmill: real-time garbage collection without motion sickness

ACM SIGPLAN Notices
Real-time replication garbage collection

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Garbage collection: algorithms for automatic dynamic memory management

Garbage collection: algorithms for automatic dynamic memory management
Region-based memory management

Information and Computation
A compacting incremental collector and its performance in a production quality compiler

Proceedings of the 1st international symposium on Memory management
A region inference algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
On bounding time and space for multiprocessor garbage collection

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
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 generational mostly-concurrent garbage collector

Proceedings of the 2nd international symposium on Memory management
A nonrecursive list compacting algorithm

Communications of the ACM
A parallel, real-time garbage collector

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
An algorithm for parallel incremental compaction

Proceedings of the 3rd international symposium on Memory management
Combining region inference and garbage collection

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Beltway: getting around garbage collection gridlock

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
An experimental study of renewal-older-first garbage collection

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A real-time garbage collector with low overhead and consistent utilization

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implementation Strategies for First-Class Continuations

Higher-Order and Symbolic Computation
Incremental Collection of Mature Objects

IWMM '92 Proceedings of the International Workshop on Memory Management
Concurrent Remembered Set Refinement in Generational Garbage Collection

Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium
Older-first garbage collection in practice: evaluation in a Java Virtual Machine

Proceedings of the 2002 workshop on Memory system performance
Controlling fragmentation and space consumption in the metronome, a real-time garbage collector for Java

Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Trading data space for reduced time and code space in real-time garbage collection on stock hardware

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
Mark-copy: fast copying GC with less space overhead

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Garbage-first garbage collection

Proceedings of the 4th international symposium on Memory management
The pauseless GC algorithm

Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments
C4: the continuously concurrent compacting collector

Proceedings of the international symposium on Memory management
Scalable garbage collection via remembered set summarization and refinement

Scalable garbage collection via remembered set summarization and refinement

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regional garbage collection is scalable, with theoretical worst-case bounds for gc latency, MMU, and throughput that are independent of mutator behavior and the volume of reachable storage. Regional collection improves upon the worst-case pause times and MMU seen in most other general-purpose collectors, including garbage-first and concurrent mark/sweep collectors.