IMP: Indirect Memory Prefetcher
Machine learning, graph analytics and sparse linear algebra-based applications are dominated by irregular memory accesses resulting from following edges in a graph or non-zero elements in a sparse matrix. These accesses have little temporal or spatial locality, and thus incur long memory stalls and...
Main Authors: | Yu, Xiangyao (Contributor), Hughes, Christopher J. (Author), Satish, Nadathur (Author), Devadas, Srinivas (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2017-12-01T22:03:16Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
PrORAM: dynamic prefetcher for oblivious RAM
by: Yu, Xiangyao, et al.
Published: (2021) -
Banshee: Bandwidth-Efficient DRAM Caching via Software/Hardware Cooperation
by: Yu, Xiangyao, et al.
Published: (2021) -
Tardis: Time Traveling Coherence Algorithm for Distributed Shared Memory
by: Yu, Xiangyao, et al.
Published: (2018) -
Taurus: lightweight parallel logging for in-memory database management systems
by: Xia, Yu, et al.
Published: (2022) -
Prefetch mechanisms by application memory access pattern
by: Agaram, Kartik Kandadai
Published: (2011)