Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems

Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many LDS prefetching techniques 1) generate a large number of useless prefetches, thereby degrading performance and bandwidth efficiency, 2) require significant hardware or storage cost, or 3) when employed together with stream-based prefetchers, cause significant resource contention in the memory system. As a result, existing processors do not employ LDS prefetchers even though they commonly employ stream-based prefetchers. This paper proposes a low-cost hardware/software cooperative technique that enables bandwidth-efficient prefetching of linked data structures. Our solution has two new components: 1) a compilerguided prefetch filtering mechanism that informs the hardware about which pointer addresses to prefetch, 2) a coordinated prefetcher throttling mechanism that uses run-time feedback to manage the interf...

• Type: Conference
• Year: 2009
• Where: HPCA
• Authors: Eiman Ebrahimi, Onur Mutlu, Yale N. Patt
• Keywords: Computer Architecture, HPCA 2009, LDS Prefetching Techniques, Memory Bandwidth Consumption, Stream-based Prefetchers