Improving Pointer-Based Codes Through Cache-Conscious Data Placement (1998)
| Citations: | 12 - 1 self |
BibTeX
@MISC{Chilimbi98improvingpointer-based,
author = {Trishul M. Chilimbi and James R. Larus and Mark D. Hill},
title = {Improving Pointer-Based Codes Through Cache-Conscious Data Placement},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Processor and memory technology trends show a continual increase in the cost of accessing main memory. Machine designers have tried to mitigate the effect of this trend through hardware and software prefetching, multiple levels of cache, non-blocking caches, dynamic instruction scheduling, speculative execution, etc. These techniques, unfortunately, have only been partially successful for pointer-manipulating programs. This paper explores the complementary approach of redesigning and reorganizing data structures to improve cache locality. Pointer-based structures allow data to be placed in arbitrary locations in memory, and consequently in a cache. This freedom enables a programmer to improve performance by applying techniques such as clustering, compression, and coloring. To reduce the cost and complexity of applying these techniques, this paper also presents two semiautomatic techniques for implementing cache-conscious data structures with minimal programmer effort. The first reorg...
Citations
No citations identified.
