Segregating heap objects by reference behavior and lifetime
Authors:
Open Access
- 1 October 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 32 (5) , 12-23
Abstract
Dynamic storage allocation has become increasingly important in many applications, in part due to the use of the object-oriented paradigm. At the same time, processor speeds are increasing faster than memory speeds and programs are increasing in size faster than memories. In this paper, we investigate efforts to predict heap object reference and lifetime behavior at the time objects are allocated. Our approach uses profile-based optimization, and considers a variety of different information sources present at the time of object allocation to predict the object's reference frequency and lifetime. Our results, based on measurements of six allocation intensive programs, show that program references to heap objects are highly predictable and that our prediction methods can successfully predict the behavior of these heap objects. We show that our methods can decrease the page fault rate of the programs measured, sometimes dramatically, in cases where the physical memory available to the program is constrained.Keywords
This publication has 15 references indexed in Scilit:
- Memory allocation costs in large C and C++ programsSoftware: Practice and Experience, 1994
- ATOM1994
- Accurate static estimators for program optimization1994
- Using lifetime predictors to improve memory allocation performance1993
- Improving the cache locality of memory allocation1993
- Caching considerations for generational garbage collection1992
- Program optimization for instruction caches1989
- Improving locality of reference in a garbage-collecting memory management systemCommunications of the ACM, 1988
- Garbage collection in a large LISP system1984
- New methods for dynamic storage allocation (Fast Fits)1983