Abstract
Sequential prefetching is a classic method of prefetching cache contents. There are two variants of sequential prefetching. Prefetch-on-miss prefetches the next consecutive cache lines following the line that misses in the cache. Tagged prefetch prefetches the next consecutive lines of the cache line that is currently being accessed. In this paper, we compare these two variants both analytically and experimentally, and show that while tagged prefetch is better with smaller latencies, prefetch-onmiss is better when the memory latency is large.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fredrik Dahlgren, Michel Dubois, and Per Stenstrom. Sequential hardware prefetching in shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 6(7):733–746, July 1995.
Nathalie Drach. Hardware implementation issues of data prefetching. In Proceedings of the International Conference on Supercomputing, pages 245–254. ACM Press, 1995.
Norman P Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. In Proceedings of the 17 th International Conference on Supercomputing, pages 364–373. IEEE Press, 1990.
AJ Smith. Cache memories. ACM Computing Surveys, 1992.
Steven VanderWiel and David Lilja. When caches aren’t enough: Data prefetching techniques. Computer, pages 23–30, July 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manoharan, S., Yavasani, C.R. (2001). Experiments with Sequential Prefetching. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-48228-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42293-8
Online ISBN: 978-3-540-48228-4
eBook Packages: Springer Book Archive