Conservative Garbage Collection for General Memory Allocators

15 years 10 months ago

Download www.cs.purdue.edu

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-ofthe-art conservative garbage collector. Keywords Conservative garbage collection, memory allocation, automatic memory management.

Gustavo Rodriguez-Rivera, Michael Spertus, Charles

Real-time Traffic

Conservative Garbage | Conservative Garbage Collection | Conservative Garbage Collector | Hardware | IWMM 2000 |

claim paper

Related Content

» Precise garbage collection for C

» Comparing MostlyCopying and MarkSweep Conservative Collection

» The economics of garbage collection

» Waste not want not resourcebased garbage collection in a shared environment

» A RealTime Garbage Collector for Embedded Applications in CLI

» Myths and realities the performance impact of garbage collection

» Allocationphase aware thread scheduling policies to improve garbage collection performance

» On Garbage and Program Logic

» Dynamic heap type inference for program understanding and debugging

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	IWMM
Authors	Gustavo Rodriguez-Rivera, Michael Spertus, Charles Fiterman

Comments (0)

Sciweavers

Conservative Garbage Collection for General Memory Allocators

Conservative Garbage | Conservative Garbage Collection | Conservative Garbage Collector | Hardware | IWMM 2000 |

Explore & Download

Productivity Tools

Sciweavers