Automatic compiler-inserted prefetching for pointer-based applications

作     者：Luk, CK Mowry, TC 

作者机构：Univ Toronto Dept Comp Sci Toronto ON M5S 3G4 Canada Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：1999年第48卷第2期

页      面：134-141页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：International Business Machines Corporation  IBM 

主　　题：caches prefetching pointer-based applications recursive data structures compiler optimization shared-memory multiprocessors performance evaluation 

摘      要：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.