As the trends of process scaling make memory systems an even more crucial bottleneck, the
importance of latency hiding techniques such as prefetching grows further. However, naively …

Past research has proposed numerous hardware prefetching techniques, most of which rely
on exploiting one specific type of program context information (eg, program counter …

Pointer chasing is a fundamental operation, used by many important data-intensive
applications (eg, databases, key-value stores, graph processing workloads) to traverse …

Is your memory hierarchy stopping your microprocessor from performing at the high level it
should be? Memory Systems: Cache, DRAM, Disk shows you how to resolve this problem …

A new structure for implementing data cache prefetching is proposed and analyzed via
simulation. The structure is based on a Global History Buffer that holds the most recent miss …

This paper presents Voyager, a novel neural network for data prefetching. Unlike previous
neural models for prefetching, which are limited to learning delta correlations, our model can …

This paper introduces the Irregular Stream Buffer (ISB), a prefetcher that targets irregular
sequences of temporally correlated memory references. The key idea is to use an extra level …

Data caches in general-purpose microprocessors often contain mostly dead blocks and are
thus used inefficiently. To improve cache efficiency, dead blocks should be identified and …

Big-data server applications frequently encounter data misses, and hence, lose significant
performance potential. One way to reduce the number of data misses or their effect is data …

Linked data structure (LDS) accesses are critical to the performance of many large scale
applications. Techniques have been proposed to prefetch such accesses. Unfortunately …