Automatic compiler-inserted prefetching for pointer-based applications

Chi-Keung Luk

doi:10.1109/12.752654

Automatic compiler-inserted prefetching for pointer-based applications

1999-01-01

28

PRE

AI

DOI：10.1109/12.752654

Original

Original request for help

Save

Abstract

En 中文

As the disparity between processor and memory speeds continues to grow, memory latency is becoming an increasingly important performance bottleneck. While software-controlled prefetching is an attractive technique for tolerating this latency, its success has been limited thus far to array-based numeric codes. In this paper, we expand the scope of automatic compiler-inserted prefetching to also include the recursive data structures commonly found in pointer-based applications. We propose three compiler-based prefetching schemes, and automate the most widely applicable scheme (greedy prefetching) in an optimizing research compiler. Our experimental results demonstrate that compiler-inserted prefetching can offer significant performance gains on both uniprocessors and large-scale shared-memory multiprocessors.

Keywords:

caches

prefetching

pointer-based applications

recursive data structures

compiler optimization

shared-memory multiprocessors

performance evaluation

Automatic compiler-inserted prefetching for pointer-based applications

Abstract

Journal

Organization