When caches aren't enough: data prefetching techniques
- 1 July 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 30 (7) , 23-30
- https://doi.org/10.1109/2.596622
Abstract
With data prefetching, memory systems call data into the cache before the processor needs it, thereby reducing memory-access latency. Using the most suitable techniques is critical to maximizing data prefetching's effectiveness. The authors review three popular prefetching techniques: software-initiated prefetching, sequential hardware-initiated prefetching, and prefetching via reference prediction tables.Keywords
This publication has 10 references indexed in Scilit:
- A performance study of software and hardware data prefetching schemesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The performance impact of block sizes and fetch strategiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Advanced performance features of the 64-bit PA-8000Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Effectiveness of hardware-based stride and sequential prefetching in shared-memory multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Compiler-based prefetching for recursive data structuresPublished by Association for Computing Machinery (ACM) ,1996
- SPAID: software prefetching in pointer- and call-intensive environmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- Effective hardware-based data prefetching for high-performance processorsIEEE Transactions on Computers, 1995
- Fixed and Adaptive Sequential Prefetching in Shared Memory MultiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Design and evaluation of a compiler algorithm for prefetchingPublished by Association for Computing Machinery (ACM) ,1992
- Cache MemoriesACM Computing Surveys, 1982