This paper describes Automatic Pool Allocation, a transformation framework that segregates
distinct instances of heap-based data structures into seperate memory pools and allows …

We present and evaluate a simple, yet efficient optimization technique that improves
memory-hierarchy performance for pointer-centric applications by up to 24% and reduces …

Providing high performance for pointer-intensive programs on modern architectures is an
increasingly difficult problem for compilers. Pointer-intensive programs are often bound by …

Automatic object inlining [19, 20] transforms heap data structures by fusing parent and child
objects together. It can improve runtime by reducing object allocation and pointer …

Data-layout optimizations rearrange fields within objects, objects within objects, and objects
within the heap, with the goal of increasing spatial locality. While the importance of data …

Region-based memory management can be used to control dynamic memory allocations
and deallocations safely and efficiently. Existing (direct-style) region systems that statically …

We present a heap-profiling tool for exploring the potential for space savings in Java
programs. The output of the tool is used to direct rewriting of application source code in a …

Heap memory allocation plays an important role in modern applications. Conventional heap
allocators, however, generally ignore the underlying memory hierarchy of the system …

In this paper, we introduce the notion of prolific and non-prolific types, based on the number
of instantiated objects of those types. We demonstrate that distinguishing between these …

Parallel, multithreaded C and C++ programs such as web servers, database managers,
news servers, and scientific applications are becoming increasingly prevalent. For these …