Compiler-directed Data Prefetching in Multiprocessors with Memory Hierarchies (1990)
| Venue: | In International Conference on Supercomputing |
| Citations: | 87 - 7 self |
BibTeX
@INPROCEEDINGS{Gornish90compiler-directeddata,
author = {Edward H. Gornish and Elana D. Granston and Alexander V. Veidenbaum},
title = {Compiler-directed Data Prefetching in Multiprocessors with Memory Hierarchies},
booktitle = {In International Conference on Supercomputing},
year = {1990},
pages = {354--368}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Memory hierarchies are used by multiprocessor systems to reduce large memory access times. It is necessary to automatically manage such a hierarchy, to obtain effective memory utilization. In this paper, we discuss the various issues involved in obtaining an optimal memory management strategy for a memory hierarchy. We present an algorithm for finding the earliest point in a program that a block of data can be prefetched. This determination is based on the control and data dependences in the program. Such a method is an integral part of more general memory management algorithms. We demonstrate our method's potential by using static analysis to estimate the performance improvement afforded by our prefetching strategy and to analyze the reference patterns in a set of Fortran benchmarks. We also study the effectiveness of prefetching in a realistic shared-memory system using an RTL-level simulator and real codes. This differs from previous studies by considering prefetching benefits in th...
