Sebastien Marion, Richard Jones, and Chris Ryder

Abstract

Pretenuring long-lived and immortal objects into infrequently or never collected regions reduces garbage collection costs significantly.
However, extant approaches either require computationally expensive, application-specific, off-line profiling,
or consider only allocation sites common to all programs, i.e. invoked by the virtual machine rather than application programs.
In contrast, we show how a simple program analysis, combined with an object lifetime knowledge bank, can be exploited to match both runtime system and application program structure with object lifetimes.
The complexity of the analysis is linear in the size of the program, so need not be run ahead of time.
We obtain performance gains between 6-77% in GC time against a generational
copying collector for several SPEC jvm98 programs.