Year: 2000
Type: conference-paper
Abstract: OverviewPretenuring is a technique for reducing copying costs in garbage collectors.When pretenuring, the allocator places long-lived objects into regions that the garbage collector will rarely, if ever, collect.We extend previous work on profiling-driven pretenuring as follows.(1) We develop a collector-neutral approach to obtaining object lifetime profile information.We show that our collection of Java programs exhibits a very high degree of homogeneity of object lifetimes at each allocation site.This result is robust with respect to different inputs, and is similar to previous work on ML, but is in contrast to C programs, which require dynamic call chain context information to extract homogeneous lifetimes.Call-site homogeneity considerably simplifies the implementation of pretenuring and makes it more efficient.(2) Our pretenuring advice is neutral with respect to the collector algorithm, and we use it to improve two quite different garbage collectors: a traditional generational collector and an older-first collector.The system is also novel because it classifies and allocates objects into 3 categories: we allocate immortal objects into a permanent region that the collector will never consider, long-lived objects into a region in which the collector placed survivors of the most recent collection, and shortlived objects into the nursery, i.e., the default region.(3) We evaluate pretenuring on Java programs.Our simulation results show that pretenuring significantly reduces collector copying for generational and older-first collectors.
Institution: University of Massachusetts Amherst
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: garbage collection, Java, nurseries
Open Access status: bronze
OpenAlex ID: W1986917522
