TU Darmstadt / ULB / TUbiblio

Headroom-based pretenuring: dynamically pretenuring objects that live “long enough”

Sewe, Andreas and Yuan, Dingwen and Sinschek, Jan and Mezini, Mira (2010):
Headroom-based pretenuring: dynamically pretenuring objects that live “long enough”.
In: Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java - PPPJ '10, pp. 29-38,
8th International Conference on the Principles and Practice of Programming in Java - PPPJ '10, Vienna, Austria, 15-17 Sep 2010, [Conference or Workshop Item]

Abstract

Many modern garbage collectors are generational, operating under the assumption that “most objects die young.” Such collectors allocate all objects in a frequently collected nursery and tenure only surviving objects to a less-frequently collected, older generation. But these survivors induce copying costs upon tenuring. To avoid these costs, pretenuring schemes construct classifiers to predict whether an object will be long-lived or short-lived; accordingly, it is tenured or not immediately upon allocation. Up to now, however, these predictions did not account for one important fact: the proximity of the next collection. In contrast, headroom-based pretenuring does take this into account; thus, it can dynamically pretenure objects whenever they live “long enough.”

We devised two ways to estimate an object's lifetime from garbage collection traces. This led to two headroom-based pretenuring schemes, which we implemented on top of Jikes RVM and MMTk. Our experiments show that the dynamic, headroom-based pretenuring schemes outperform static schemes in terms of collector performance, albeit at the cost of increased mutator overhead.

Item Type: Conference or Workshop Item
Erschienen: 2010
Creators: Sewe, Andreas and Yuan, Dingwen and Sinschek, Jan and Mezini, Mira
Title: Headroom-based pretenuring: dynamically pretenuring objects that live “long enough”
Language: English
Abstract:

Many modern garbage collectors are generational, operating under the assumption that “most objects die young.” Such collectors allocate all objects in a frequently collected nursery and tenure only surviving objects to a less-frequently collected, older generation. But these survivors induce copying costs upon tenuring. To avoid these costs, pretenuring schemes construct classifiers to predict whether an object will be long-lived or short-lived; accordingly, it is tenured or not immediately upon allocation. Up to now, however, these predictions did not account for one important fact: the proximity of the next collection. In contrast, headroom-based pretenuring does take this into account; thus, it can dynamically pretenure objects whenever they live “long enough.”

We devised two ways to estimate an object's lifetime from garbage collection traces. This led to two headroom-based pretenuring schemes, which we implemented on top of Jikes RVM and MMTk. Our experiments show that the dynamic, headroom-based pretenuring schemes outperform static schemes in terms of collector performance, albeit at the cost of increased mutator overhead.

Title of Book: Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java - PPPJ '10
Uncontrolled Keywords: Generational garbage collection, dynamic pretenuring, lifetime estimation, headroom
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Software Technology
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Zentrale Einrichtungen
LOEWE
LOEWE > LOEWE-Zentren
Event Title: 8th International Conference on the Principles and Practice of Programming in Java - PPPJ '10
Event Location: Vienna, Austria
Event Dates: 15-17 Sep 2010
Date Deposited: 28 Sep 2010 16:54
Official URL: http://dx.doi.org/10.1145/1852761.1852767
Identification Number: doi:10.1145/1852761.1852767
Corresponding Links:
Alternative keywords:
Alternative keywordsLanguage
Measurement, PerformanceEnglish
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details