Proceedings of the 2006 Conference of the Center for Advanced Studies on Collaborative Research - CASCON '06 2006
DOI: 10.1145/1188966.1188974
|View full text |Cite
|
Sign up to set email alerts
|

Utilizing field usage patterns for Java heap space optimization

Abstract: This research studies the characteristics of field usage patterns in the SpecJVM98 benchmarks. It finds that multiple object instances of the same class often exhibit different field-usage patterns. Motivated by this observation, we designed a heap compression mechanism that classifies object instances at runtime based on their field-usage patterns and eliminates unused fields to save space. To achieve the maximum space savings while minimizing the space and time overhead, our design combines three interrelate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…Chen et al consider the lifetime of object fields, rather than whole objects, since a field may not be active for the duration of its enclosing object's life; thus, fields with disjoint lifetimes can occupy the same memory, thereby reducing object footprint [32]. Similar work studied field lifetimes for the SpecJVM98 benchmark suite, and found on average a 14% reduction in heap space was possible [33]. Shankar et al profiled Java programs in an effort to identify short-live objects suitable for stack allocation [34].…”
Section: Profilingmentioning
confidence: 99%
“…Chen et al consider the lifetime of object fields, rather than whole objects, since a field may not be active for the duration of its enclosing object's life; thus, fields with disjoint lifetimes can occupy the same memory, thereby reducing object footprint [32]. Similar work studied field lifetimes for the SpecJVM98 benchmark suite, and found on average a 14% reduction in heap space was possible [33]. Shankar et al profiled Java programs in an effort to identify short-live objects suitable for stack allocation [34].…”
Section: Profilingmentioning
confidence: 99%
“…Kunkle and Cooperman [2008] [Bacon et al, 2002;Bonny and Henkel, 2007;Chen et al, 2005Chen et al, , 2003Clausen et al, 2000;Lekatsas et al, 2000;Lekatsas and Wolf, 1999;Rizzo, 1997;Shaham et al, 2001;Venstermans et al, 2007], heap sharing [Choi and Han, 2008], bytecode optimization [Vallée-Rai et al, 1999, prolific types [Shuf et al, 2002], colocation [Yu et al, 2008] and many other optimization/reduction techniques [Ananian and Rinard, 2003;Guo et al, 2006;McDowell et al, 1998;Tip et al, 1999].…”
Section: External Memory Algorithmsmentioning
confidence: 99%
“…Chen et al consider the lifetime of object fields, rather than whole objects, since a field may not be active for the duration of its enclosing object's life; thus, fields with disjoint lifetimes can occupy the same memory, thereby reducing object footprint [25]. Similar work studied field lifetimes for the SpecJVM98 benchmark suite, and found on average a 14% reduction in heap space was possible [44]. Shankar et al profiled Java programs in an effort to identify short-live objects suitable for stack allocation [97].…”
Section: Object Lifecycle Profilingmentioning
confidence: 99%