Cache Prefetching

8/3/99


Click here to start


Table of Contents

  1. Cache Prefetching

  2. Outline

  3. “Traditional” Processor

  4. + Lockup-Free Cache

  5. + Out-of-Order Execution

  6. + Cache Prefetching

  7. Accuracy and Coverage

  8. Producing Prefetch Addresses

  9. Outline

  10. Strided Access

  11. Stride Prefetcher

  12. Prefetching in a Loop

  13. Overlapped Prefetching

  14. Lookahead PC (Chen and Baer)

  15. Superscalar Challenges

  16. Tango (Pinter and Yoaz)

  17. Prefetching with new LA PC

  18. Cache for Tag Memory

  19. Outline

  20. Linked Data Structure Access

  21. Detecting Recursive Accesses

  22. Roth, Moshovos, Sohi (HW)

  23. Recursive Prefetching?

  24. Luk and Mowry (SW)

  25. Pre-Order Tree Traversal

  26. Outline

  27. Markov Prefetcher (Joseph and Grunwald)

  28. Outline

  29. Hybrid Approaches (Joseph and Grunwald)

  30. Conclusions

 Author: Stefan G. Berg

Email: sgberg@cs.washington.edu

Home Page: http://www.bergs.com/stefan

Other information:
General Exam presentation given on 8/3/1999.

Download presentation source