NDLI: Improving the cache locality of memory allocation

Please wait, while we are loading the content...

Practical data breakpoints: design and implementation

Detection and recovery of endangered variables caused by instruction scheduling

Isolation and analysis of optimization errors

Efficient accommodation of may-alias information in SSA form

Abstract debugging of higher-order imperative languages

Interprocedural modification side effect analysis with pointer aliasing

A practical data flow framework for array reference analysis and its use in optimizations

Dependence-based program analysis

Interprocedural constant propagation: a study of jump function implementation

Orchestrating interactions among parallel computations

Global optimizations for parallelism and locality on scalable parallel machines

Communication optimization and code generation for distributed memory machines

First-class data-type representations in SCHEMEXEROX

Handling control

Programmable syntax macros

Compiling real-time programs into schedulable code

Improving the cache locality of memory allocation

Using lifetime predictors to improve memory allocation performance

Space efficient conservative garbage collection

Guardians in a generation-based garbage collector

Real-time replication garbage collection

Implementing type classes

The essence of compiling with continuations

Lifetime-sensitive modulo scheduling

Load/store range analysis for global register allocation

Balanced scheduling: instruction scheduling when memory latency is uncertain

Reverse If-Conversion

Branch prediction for free

Improving the cache locality of memory allocation

Content Provider	ACM Digital Library
Author	Zorn, Benjamin Henderson, Robert Grunwald, Dirk
Abstract	The allocation and disposal of memory is a ubiquitous operation in most programs. Rarely do programmers concern themselves with details of memory allocators; most assume that memory allocators provided by the system perform well. This paper presents a performance evaluation of the reference locality of dynamic storage allocation algorithms based on trace-driven simualtion of five large allocation-intensive C programs. In this paper, we show how the design of a memory allocator can significantly affect the reference locality for various applications. Our measurements show that poor locality in sequential-fit allocation algorithms reduces program performance, both by increasing paging and cache miss rates. While increased paging can be debilitating on any architecture, cache misses rates are also important for modern computer architectures. We show that algorithms attempting to be space-efficient by coalescing adjacent free objects show poor reference locality, possibly negating the benefits of space efficiency. At the other extreme, algorithms can expend considerable effort to increase reference locality yet gain little in total execution performance. Our measurements suggest an allocator design that is both very fast and has good locality of reference.
Starting Page	177
Ending Page	186
Page Count	10
File Format	PDF
ISBN	0897915984
DOI	10.1145/155090.155107
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1993-08-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improving the Cache Locality of Memory Allocation (1993)

A locality-improving dynamic memory allocator

Improving the cache locality of memory allocation

Improving Data Locality by Chunking

A compiler technique for improving whole-program locality

On Reducing False Sharing While Improving Locality on Shared Memory Multiprocessors

Cache-conscious coallocation of hot data streams

Improving test execution time with improved cache locality

A Penalty Aware Memory Allocation Scheme for Key-Value Cache

Improving the cache locality of memory allocation

Similar Documents

Improving the Cache Locality of Memory Allocation (1993)

A locality-improving dynamic memory allocator

Improving the cache locality of memory allocation

Improving Data Locality by Chunking

A compiler technique for improving whole-program locality

On Reducing False Sharing While Improving Locality on Shared Memory Multiprocessors

Cache-conscious coallocation of hot data streams

Improving test execution time with improved cache locality

A Penalty Aware Memory Allocation Scheme for Key-Value Cache

Improving the cache locality of memory allocation