Speculative prefetching
- 1 August 1993
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
A hardware prefetching mechanism named Speculative Prefetching is proposed. This scheme detects vector accesses issued by a load/store instruction and prefetches the corresponding data. The scheme requires no software add-on, and in some cases it is more powerful than software techniques for identifying regular accesses. The tradeoffs related to its hardware implementation are extensively discussed in order to finely tune the mechanism. Experiments show that average memory access time of regular codes is brought within 10% of optimum for processors with usual issue rates, while performance of irregular codes is little reduced though never degraded. The scheme performance is discussed over a wide range of parameters.Keywords
This publication has 8 references indexed in Scilit:
- Prefetch unit for vector operations on scalar computersACM SIGARCH Computer Architecture News, 1992
- An architecture for software-controlled data prefetchingPublished by Association for Computing Machinery (ACM) ,1991
- An effective on-chip preloading scheme to reduce data access penaltyPublished by Association for Computing Machinery (ACM) ,1991
- The cache performance and optimizations of blocked algorithmsPublished by Association for Computing Machinery (ACM) ,1991
- Software prefetchingPublished by Association for Computing Machinery (ACM) ,1991
- Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffersPublished by Association for Computing Machinery (ACM) ,1990
- Strategies for cache and local memory management by global program transformationJournal of Parallel and Distributed Computing, 1988
- Line (Block) Size Choice for CPU Cache MemoriesIEEE Transactions on Computers, 1987