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

Authors:
Martin Larose;Marc Feeley
Affiliations:
Département d'informatique et recherche opérationnelle, Université de Montréal;Département d'informatique et recherche opérationnelle, Université de Montréal
Venue:
Proceedings of the 1st international symposium on Memory management
Year:
1998

Citing 11
Cited 20

Performance and evaluation of LISP systems

Performance and evaluation of LISP systems
Garbage collection in an uncooperative environment

Software—Practice & Experience
A parallel virtual machine for efficient scheme compilation

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Representing control in the presence of first-class continuations

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Real-time replication garbage collection

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Polling efficiently on stock hardware

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Concurrent programming in ERLANG (2nd ed.)

Concurrent programming in ERLANG (2nd ed.)
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM
Multiprocessing compactifying garbage collection

Communications of the ACM
A nonrecursive list compacting algorithm

Communications of the ACM
Compiling Erlang to Scheme

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming

A parallel, real-time garbage collector

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Heap architectures for concurrent languages using message passing

Proceedings of the 3rd international symposium on Memory management
An algorithm for parallel incremental compaction

Proceedings of the 3rd international symposium on Memory management
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
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
A unified theory of garbage collection

OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
An efficient parallel heap compaction algorithm

OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Message analysis-guided allocation and low-pause incremental garbage collection in a concurrent language

Proceedings of the 4th international symposium on Memory management
Mostly concurrent compaction for mark-sweep GC

Proceedings of the 4th international symposium on Memory management
BIT: A Very Compact Scheme System for Microcontrollers

Higher-Order and Symbolic Computation
Correctness-preserving derivation of concurrent garbage collection algorithms

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
The Compressor: concurrent, incremental, and parallel compaction

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Efficient memory management for concurrent programs that use message passing

Science of Computer Programming - Special issue on five perspectives on modern memory management: Systems, hardware and theory
HBench: JGC - an application-specific benchmark suite for evaluating JVM garbage collector performance

COOTS'01 Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6
Mark-sweep or copying?: a "best of both worlds" algorithm and a hardware-supported real-time implementation

Proceedings of the 6th international symposium on Memory management
The single-referent collector: Optimizing compaction for the common case

ACM Transactions on Architecture and Code Optimization (TACO)
Handles revisited: optimising performance and memory costs in a real-time collector

Proceedings of the international symposium on Memory management
Bounded-latency regional garbage collection

Proceedings of the 7th symposium on Dynamic languages
Derivation and evaluation of concurrent collectors

ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
POPL 2003: A real-time garbage collector with low overhead and consistent utilization

ACM SIGPLAN Notices - Supplemental issue

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new near-real-time compacting collector and its implementation in a production quality Scheme compiler (Gambit-C). Our goal is to use this system as a base for an implementation of Erlang for writing soft real-time telecommunication applications. We start with a description of Gambit-C's memory organisation and its blocking collector. The design and integration of the incremental collector within Gambit-C are then explained. Finally we measure the performance of the incremental collector and compare it to the original blocking collector. We found that the overhead of the incremental collector is high (a factor of 1.3 to 8.1, with a median of 2.24) but nevertheless the collection pauses are compatible with typical soft real-time requirements (we get an average pause of 2.9 milliseconds and a maximum pause of 15 milliseconds on a 133Mhz DEC Alpha 21064).