Immix
Authors:
Open Access
- 30 May 2008
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 43 (6) , 22-32
Abstract
Programmers are increasingly choosing managed languages for modern applications, which tend to allocate many short-to-medium lived small objects. The garbage collector therefore directly determines program performance by making a classic space-time tradeoff that seeks to provide space efficiency, fast reclamation, and mutator performance. The three canonical tracing garbage collectors: semi-space, mark-sweep, and mark-compact each sacrifice one objective. This paper describes a collector family, called mark-region , and introduces opportunistic defragmentation, which mixes copying and marking in a single pass. Combining both, we implement immix , a novel high performance garbage collector that achieves all three performance objectives. The key insight is to allocate and reclaim memory in contiguous regions, at a coarse block grain when possible and otherwise in groups of finer grain lines . We show that immix outperforms existing canonical algorithms, improving total application performance by 7 to 25% on average across 20 benchmarks. As the mature space in a generational collector, immix matches or beats a highly tuned generational collector, e.g. it improves jbb2000 by 5%. These innovations and the identification of a new family of collectors open new opportunities for garbage collector design.Keywords
This publication has 25 references indexed in Scilit:
- A parallel, incremental, mostly concurrent garbage collector for serversACM Transactions on Programming Languages and Systems, 2005
- A locality-improving dynamic memory allocator2005
- Controlling fragmentation and space consumption in the metronome, a real-time garbage collector for Java2003
- Beltway2002
- Adaptive optimization in the Jalapeño JVM2000
- Simple generational garbage collection and fast allocationSoftware: Practice and Experience, 1989
- Comparison of Compacting Algorithms for Garbage CollectionACM Transactions on Programming Languages and Systems, 1983
- List processing in real time on a serial computerCommunications of the ACM, 1978
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960