ACM Transactions on Programming Languages and Systems · 2006 · 29 citations · 30 references
ComputingComputer EngineeringComputer ScienceOperating SystemsParallel ComputingPerformance BudgetingGarbage CollectionMemory HierarchyMemory ManagementPerformance TuningVirtual MemoryConservative Garbage CollectionExecution Time AnalysisGarbage Collection AlgorithmsGarbage Collection OverheadGarbage Collection Overhead AnalysisMark-sweep Garbage CollectionPause Time ReductionVirtual Memory Systems
In systems that support garbage collection, a tension exists between collecting garbage too frequently and not collecting it frequently enough. Garbage collection that occurs too frequently may introduce unnecessary overheads at the risk of not collecting much garbage during each cycle. On the other hand, collecting garbage too infrequently can result in applications that execute with a large amount of virtual memory (i.e., with a large footprint) and suffer from increased execution times due to paging.In this article, we use a large set of Java applications and the highly tuned and widely used Boehm-Demers-Weiser (BDW) conservative mark-and-sweep garbage collector to experimentally examine the extent to which the frequency of garbage collection impacts an application's execution time, footprint, and pause times. We use these results to devise some guidelines for controlling garbage collection and heap growth in a conservative garbage collector in order to minimize application execution times. Then we describe new strategies for controlling garbage collection and heap growth that impact not only the frequency with which garbage collection occurs but also the points at which it occurs. Experimental results demonstrate that when compared with the existing approach used in the standard BDW collector, our new strategy can significantly reduce application execution times.Our goal is to obtain a better understanding of how to control garbage collection and heap growth for an individual application executing in isolation. These results can be applied in a number of high-performance computing and server environments, in addition to some single-user environments. This work should also provide insights into how to make better decisions that impact garbage collection in multiprogrammed environments.
30
Garbage collection in a large LISP system
David A. Moon · 1984 · 276 citations · Full text
Java without the coffee breaks
David F. Bacon, C. R. Attanasio, Han B. Lee et al. · 2001 · 133 citations