Creating and preserving locality of Java applications at allocation and garbage collection times

Yefim Shuf, Manish Gupta, Hubertus Franke, Andrew Wilson Appel, Jaswinder Pal Singh

Research output: Contribution to journalArticle

Abstract

The growing gap between processor and memory speeds is motivating the need for optimization strategies that improve data locality. A major challenge is to devise techniques suitable for pointer-intensive applications. This paper presents two techniques aimed at improving the memory behavior of pointer-intensive applications with dynamic memory allocation, such as those written in Java. First, we present an allocation time object placement technique based on the recently introduced notion of prolific (frequently instantiated) types. We attempt to co-locate, at allocation time, objects of prolific types that are connected via object references. Then, we present a novel locality based graph traversal technique. The benefits of this technique, when applied to garbage collection (GC), are twofold: (i) it improves the performance of GC due to better locality during a heap traversal and (ii) it restructures surviving objects in a way that enhances locality. On multiprocessors, this technique can further reduce overhead due to synchronization and false sharing. The experimental results, on a well-known suite of Java benchmarks (SPECjvm98 [26], SPECjbb2000 [27], and jOlden [4]), from an implementation of these techniques in the Jikes RVM [1], are very encouraging. The object co-allocation technique improves application performance by up to 21% (10% on average) in the Jikes RVM configured with a non-copying mark- and-sweep collector. The locality-based traversal technique reduces GC times by up to 20% (10% on average) and improves the performance of applications by up to 14% (6% on average) in the Jikes RVM configured with a copying semi-space collector. Both techniques combined can improve application performance by up to 22% (10% on average) in the Jikes RVM configured with a non-copying mark-and-sweep collector.

Original languageEnglish (US)
Pages (from-to)13-25
Number of pages13
JournalACM SIGPLAN Notices
Volume37
Issue number11
DOIs
StatePublished - Nov 2012

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Keywords

  • Garbage collection
  • Heap traversal
  • JVM
  • Java
  • Locality
  • Locality based graph traversal
  • Memory allocation
  • Memory management
  • Object co-allocation
  • Object placement
  • Prolific types
  • Run-time systems

Fingerprint Dive into the research topics of 'Creating and preserving locality of Java applications at allocation and garbage collection times'. Together they form a unique fingerprint.

  • Cite this