A locality-improving dynamic memory allocator

Authors:
Yi Feng;Emery D. Berger
Affiliations:
University of Massachusetts Amherst, Amherst, MA;University of Massachusetts Amherst, Amherst, MA
Venue:
Proceedings of the 2005 workshop on Memory system performance
Year:
2005

Citing 17
Cited 13

Garbage collection in an uncooperative environment

Software—Practice & Experience
Improving the cache locality of memory allocation

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Using lifetime predictors to improve memory allocation performance

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
The memory fragmentation problem: solved?

Proceedings of the 1st international symposium on Memory management
Segregating heap objects by reference behavior and lifetime

Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Cache-conscious structure layout

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Composing high-performance memory allocators

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Hoard: a scalable memory allocator for multithreaded applications

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Implemting heap-object behavior prediction efficiently and effectively

Software—Practice & Experience
Reconsidering custom memory allocation

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Dynamic Storage Allocation: A Survey and Critical Review

IWMM '95 Proceedings of the International Workshop on Memory Management
Flexible reference trace reduction for VM simulations

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Controlling fragmentation and space consumption in the metronome, a real-time garbage collector for Java

Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Improving Cache Behavior of Dynamically Allocated Data Structures

PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
Non-compacting memory allocation and real-time garbage collection

Non-compacting memory allocation and real-time garbage collection
Automatic heap sizing: taking real memory into account

Proceedings of the 4th international symposium on Memory management
Malloc(3) revisited

ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference

Quantifying the performance of garbage collection vs. explicit memory management

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Scalable locality-conscious multithreaded memory allocation

Proceedings of the 5th international symposium on Memory management
DieHard: probabilistic memory safety for unsafe languages

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Free-Me: a static analysis for automatic individual object reclamation

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Feasibility of decoupling memory management from the execution pipeline

Journal of Systems Architecture: the EUROMICRO Journal
Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Two memory allocators that use hints to improve locality

Proceedings of the 2009 international symposium on Memory management
Memory management thread for heap allocation intensive sequential applications

Proceedings of the 10th workshop on MEmory performance: DEaling with Applications, systems and architecture
Optimal resource management for a model driven LTE protocol stack on a multicore platform

Proceedings of the 8th ACM international workshop on Mobility management and wireless access
A study of Java's non-Java memory

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Cling: A memory allocator to mitigate dangling pointers

USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Simulation of high-performance memory allocators

Microprocessors & Microsystems
Taking off the gloves with reference counting Immix

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In general-purpose applications, most data is dynamically allocated. The memory manager therefore plays a crucial role in application performance by determining the spatial locality of heap objects. Previous general-purpose allocators have focused on reducing fragmentation, while most locality-improving allocators have either focused on improving the locality of the allocator (not the application), or required programmer hints or profiling to guide object placement. We present a high-performance memory allocator called Vam that transparently improves both cache-level and page-level locality of the application while achieving low fragmentation. Over a range of large-footprint benchmarks, Vam improves application performance by an average of 4%-8% versus the Lea (Linux) and FreeBSD allocators. When memory is scarce, Vam improves application performance by up to 2X compared to the FreeBSD allocator, and by over 10X compared to the Lea allocator.