University of Cambridge > > Computer Laboratory Computer Architecture Group Meeting > Stream Chaining: Exploiting Multiple Levels of Correlation in Data Prefetching

Stream Chaining: Exploiting Multiple Levels of Correlation in Data Prefetching

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Robert Mullins.

Data prefetching has long been an important technique to amortize the effects of the memory wall, and is likely to remain so in the current era of multi-core systems. Most prefetchers operate by identifying patterns and correlations in the miss address stream. Separating streams according to the memory access instruction that generates the misses is an effective way of filtering out spurious addresses from predictable streams. On the other hand, by localizing streams based on the memory access instructions, such prefetchers both lose the complete time sequence information of misses and can only issue prefetches for a single memory access instruction at a time.

In this talk we introduce a novel class of prefetchers based on the idea of linking various localized streams into predictable chains of missing memory access instructions such that the prefetcher can issue prefetches along multiple streams. In this way the prefetcher is not limited to prefetching deeply for a single missing memory access instruction but can instead adaptively prefetch for other memory access instructions closer in time. Experimental results show that the proposed prefetcher consistently achieves better performance than a state-of-the-art prefetcher – 10% on average, being only outperformed in very few cases and then by only 2%, and outperforming that prefetcher by as much as 55% – while consuming the same amount of memory bandwidth.

This talk is part of the Computer Laboratory Computer Architecture Group Meeting series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity