Effective Hardware-Based Data Prefetching for High-Performance Processors

IEEE Transactions on Computers

Volumn 44, Issue 5, 1995, Pages 609-623

  Chen, Tien Fu ^a   Baer, Jean Loup ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

branch prediction; cycle by cycle simulations; data cache; hardware function unit; Prefetching; reference prediction

Indexed keywords

BRANCH PREDICTION; CYCLE BY CYCLE SIMULATIONS; DATA CACHE; HARDWARE BASED DATA PREFETCHING; HARDWARE FUNCTION UNIT; REFERENCE PREDICTION;

BANDWIDTH; BUFFER STORAGE; COMPUTER HARDWARE; CORRELATION THEORY; DATA PROCESSING; ITERATIVE METHODS; LOGIC DESIGN;

MICROPROCESSOR CHIPS;

EID: 0029308368     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.381947     Document Type: Article

References (26)

1. J.-L. Baer and T.-F. Chen, “An effective on-chip preloading scheme to reduce data access penalty,” Proc. Supercomputing ′91, pp. 176–186, 1991.
2. J.-L. Baer and W.-H. Wang, “Multilevel cache hierarchies: Organizations, protocols, and performance,” J. Parallel and Distributed Computing, vol. 6, no. 3, pp. 451–476, 1989.
3. T. Ball and J.R. Larus, “Branch prediction for free,” Technical Report #1137, Computer Science Dept., Univ. of Wis.-Madison, Feb. 1993.
4. T.-F. Chen, “Data prefetching for high-performance processors,” PhD thesis, Dept. of Computer Science and Engineering, Univ. of Wash., 1993.
5. T.-F. Chen and J.-L. Baer, “Reducing memory latency via nonblocking and prefetching caches,” Proc. Fifth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 51–61, 1992.
6. W.Y. Chen, S.A. Mahlke, P.P. Chang, and W.-M. Hwu, “Data access microarchitectures for superscalar processors with compiler-assisted data prefetching,” Proc. 24th Int'l Symp. Microarchitecture, 1991.
7. J.W.C. Fu and J.H. Patel, “Data prefetching in multiprocessor vector cache memories,” Proc. 18th Ann. Int'l Symp. Computer Architecture, pp. 54–63, 1991.
8. J.W.C. Fu and J.H. Patel, “Stride directed prefetching in scalar processors,” Proc. 25th Int'l Symp. Microarchitecture, pp. 102–110, Dec. 1992.
9. D. Gannon, W. Jalby, and K. Gallivan, “Strategies for cache and local memory management by global program transformation,” J. Parallel and Distributed Computing, vol. 5, no. 5, pp. 587–616, Oct. 1988.
10. E. Gornish, E. Granston, and A. Veidenbaum, “Compiler-directed data prefetching in multiprocessors with memory hierarchies,” Proc. 1990 Int'l Conf. Supercomputing, pp. 354–368, 1990.
11. N.P. Jouppi, “Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers,” Proc. 17th Ann. Int'l Symp. Computer Architecture, pp. 364–373, May 1990.
12. A.C. Klaiber and H.M. Levy, “An architecture for software-controlled data prefetching,” Proc. 18th Ann. Int'l Symp. Computer Architecture, pp. 43–53, 1991.
13. D. Kroft, “Lockup-free instruction fetch/prefetch cache organization,” Proc. Eighth Ann. Int'l Symp. Computer Architecture, pp. 81–87, 1981.
14. J.K.F. Lee and A.J. Smith, “Branch prediction strategies and branch target buffer design,” Computer, pp. 6–22, Jan. 1984.
15. R.L. Lee, P-C. Yew, and D.H. Lawrie, “Data prefetching in shared memory multiprocessors,” Proc. Int'l Conf. Parallel Processing, pp. 28–31, 1987.
16. R.L. Lee, P-C. Yew, and D.H. Lawrie, “Multiprocessor Cache design considerations,” Proc. 14th Ann. Int'l Symp. Computer Architecture, pp. 253–262, 1987.
17. T. Mowry and A. Gupta, “Tolerating latency through software-controlled prefetching in shared-memory multiprocessors,” J. Parallel and Distributed Computing, vol. 12, no. 2, pp. 87–106, June 1991.
18. T. Mowry, M.S. Lam, and A. Gupta, “Design and evaluation of a compiler algorithm for prefetching,” Proc. Fifth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 62–73, 1992.
19. S.-T. Pa, K. So, and J.T. Rahmeh, “Improving the accuracy of dynamic branch prediction using branch correlation,” Proc. Fifth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 76–84, 1992.
20. C.H. Perleberg and A.J. Smith, “Branch target buffer design and optimization,” Technical Report UCB/CSD 89/552, Univ. of Calif., Berkeley, Dec. 1989.
21. A.K. Porterfield, “Software methods for improvement of cache performance on supercomputer applications,” Technical Report COMP TR 89–93, Rice Univ., May 1989.
22. S. Przybylski, “The performance impact of block sizes and fetch strategies,” Proc. 17th Ann. Int'l Symp. Computer Architecture, pp. 160–169, May 1990.
23. I. Sklenar, “Prefetch unit for vector operations on scalar computers,” Computer Architecture News, vol. 20, no. 4, pp. 31–37, Sept. 1992.
24. A.J. Smith, “Cache memories,” ACM Computing Surveys, vol. 14, no. 3, pp. 473–530, Sept. 1982.
25. J.E. Smith, “Decoupled access/execute computer architectures,” Proc. Ninth Ann. Int'l Symp. Computer Architecture, pp. 112–119, 1982.
26. T.Y. Yeh and Y.N. Patt, “Alternative implementation of two-level adaptive branch prediction,” Proc. 19th Ann. Int'l Symp. Computer Architecture, pp. 124–134, 1992.