The garbage collection advantage: Improving program locality
Document Type
Conference Proceeding
Publication Date
10-1-2004
Abstract
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors move objects, they have an opportunity to improve locality. However, no static copying order is guaranteed to match program traversal orders. This paper introduces online object reordering (OOR) which includes a new dynamic, online class analysis for Java that detects program traversal patterns and exploits them in a copying collector. OOR uses runtime method sampling that drives just-in-time (JIT) compilation. For each hot (frequently executed) method, OOR analysis identifies the hot field accesses. At garbage collection time, the OOR collector then copies referents of hot fields together with their parent. Enhancements include static analysis to exclude accesses in cold basic blocks, heuristics that decay heat to respond to phase changes, and a separate space for hot objects. The overhead of OOR is on average negligible and always less than 2% on Java benchmarks in Jikes RVM with MMTk. We compare program performance of OOR to static class-oblivious copying orders (e.g., breadth and depth first). Performance variation due to static orders is often low, but can be up to 25%. In contrast, OOR matches or improves upon the best static order since its history-based copying tunes memory layout to program traversal.
Publication Title
ACM SIGPLAN Notices
Recommended Citation
Huang, X.,
Blackburn, S.,
McKinley, K.,
Moss, J.,
Wang, Z.,
&
Cheng, P.
(2004).
The garbage collection advantage: Improving program locality.
ACM SIGPLAN Notices,
39(10), 69-80.
http://doi.org/10.1145/1035292.1028983
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/12474