Experiments with Sequential Prefetching

Authors:
Sathiamoorthy Manoharan;Chaitanya Reddy Yavasani
Affiliations:
-;-
Venue:
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Year:
2001

Citing 4
Cited 0

Hardware implementation issues of data prefetching

ICS '95 Proceedings of the 9th international conference on Supercomputing
Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
When Caches Aren't Enough: Data Prefetching Techniques

Computer
Sequential Hardware Prefetching in Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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-on-miss is better when the memory latency is large.