PFetch
Jaydeep Marathe, Frank Mueller · 2008
CPU speeds have increased faster than the rate of improvement in memory access latencies in the recent past. As a result, with programs that suffer excessive cache misses, the CPU will increasingly be stalled waiting for the memory system to provide the requested memory line. Prefetching is a latency hiding technique that tackles this problem. If the address of the memory line that misses in cache can be predicted sufficiently in advance, it can be prefetched into the cache before it is accessed, reducing the effective latency of that access.
Cited by 4 works. doi:10.1145/1509084.1509085
Authors
References
- Improving direct-mapped cache performance by the addition of a small fully-associative cache prefetch buffers
- Design and evaluation of a compiler algorithm for prefetching
- SPEC CPU2000: measuring CPU performance in the New Millennium
- Efficient detection of all pointer and array access errors
- Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
- Evaluating stream buffers as a secondary cache replacement
- Prefetching using Markov predictors
- Dependence based prefetching for linked data structures
- Ispike: A Post-link Optimizer for the Intel®Itanium®Architecture
- SPAID: software prefetching in pointer- and call-intensive environments