Skip to main content
Article thumbnail
Location of Repository

Automatic Heap Sizing: Taking Real Memory into Account

By Ting Yang, Matthew Hertz, Emery D. Berger, Scott F. Kaplan, J. Eliot and B. Moss

Abstract

Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application’s needs causes excessive GC overhead, while a heap that exceeds physical memory induces paging. Choosing the best heap size a priori is impossible in multiprogrammed environments, where physical memory allocations to processes change constantly. We present an automatic heap-sizing algorithm applicable to different garbage collectors with only modest changes. It relies on an analytical model and on detailed information from the virtual memory manager. The model characterizes the relation between collection algorithm, heap size, and footprint. The virtual memory manager tracks recent reference behavior, reporting the current footprint and allocation to the collector. The collector uses those values as inputs to its model to compute a heap size that maximizes throughput while minimizing paging. We show that our adaptive heap sizing algorithm can substantially reduce running time over fixed-sized heaps

Topics: Categories and Subject Descriptors D.3.4 [Programming Languages, Processors—Memory management (garbage collection) General Terms Design, Performance, Algorithms Keywords garbage collection
Publisher: ACM Press
Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.2575
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://people.cs.umass.edu/~em... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.