PPT Slide

Outline

• Introduction and Terminology

• Three Techniques
  • Stride Prefetching
  • Recursive Prefetching
  • Markov Prefetching

• Hybrid Approaches

• Conclusions

Previous slide

Next slide

Back to first slide

View graphic version

The stride prefetching techniques we just discussed are limited to those memory references that can be predicted using a constant stride. A traversal of a linked list would only fall in this category, if its elements happen to be laid out in memory sequentially. While this may happen in certain cases, it is not generally true. However, recursive prefetchers have been designed specifically for this group of memory references.