Path confidence based lookahead prefetching Conference Paper uri icon


  • 2016 IEEE. Designing prefetchers to maximize system performance often requires a delicate balance between coverage and accuracy. Achieving both high coverage and accuracy is particularly challenging in workloads with complex address patterns, which may require large amounts of history to accurately predict future addresses. This paper describes the Signature Path Prefetcher (SPP), which offers effective solutions for three classic challenges in prefetcher design. First, SPP uses a compressed history based scheme that accurately predicts complex address patterns. Second, unlike other history based algorithms, which miss out on many prefetching opportunities when address patterns make a transition between physical pages, SPP tracks complex patterns across physical page boundaries and continues prefetching as soon as they move to new pages. Finally, SPP uses the confidence it has in its predictions to adaptively throttle itself on a per-prefetch stream basis. In our analysis, we find that SPP improves performance by 27.2% over a no-prefetching baseline, and outperforms the state-of-The-Art Best Offset prefetcher by 6.4%. SPP does this with minimal overhead, operating strictly in the physical address space, and without requiring any additional processor core state, such as the PC.

name of conference

  • 2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)

published proceedings

  • 2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)

altmetric score

  • 6

author list (cited authors)

  • Kim, J., Pugsley, S. H., Gratz, P. V., Reddy, A., Wilkerson, C., & Chishti, Z.

citation count

  • 48

complete list of authors

  • Kim, Jinchun||Pugsley, Seth H||Gratz, Paul V||Reddy, AL Narasimha||Wilkerson, Chris||Chishti, Zeshan

publication date

  • October 2016