Conservative garbage collection for general memory allocators

Authors:
Gustavo Rodriguez-Rivera
Affiliations:
Geodesic Systems, 414 N. Orleans St., Suite 410, Chicago, IL
Venue:
Proceedings of the 2nd international symposium on Memory management
Year:
2000

Citing 0
Cited 4

Reconsidering custom memory allocation

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Space efficient conservative garbage collection

ACM SIGPLAN Notices - Best of PLDI 1979-1999
Garbage collection in the next C++ standard

Proceedings of the 2009 international symposium on Memory management
OOPSLA 2002: Reconsidering custom memory allocation

ACM SIGPLAN Notices - Supplemental issue

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper explains a technique that integrates conservative garbage collection on top of general memory allocators. This is possible by using two data structures named malloc-tables and jump-tables that are computed at garbage collection time to map pointers to beginning of objects and their sizes. This paper describes malloc-tables and jump-tables, an implementation of a malloc/jump-table based conservative garbage collector for Doug Lea's memory allocator, and experimental results that compare this implementation with Boehm-Demers-Weiser GC, a state-of-the-art conservative garbage collector.