AMC: Access to Miss Correlation Prefetcher for Evolving Graph Analytics
Abhishek Singh, Christian Schulte, Xiaochen Guo

TL;DR
This paper introduces AMC, a software-assisted hardware prefetcher tailored for evolving graph applications, significantly improving prefetch accuracy and coverage over prior methods by exploiting access correlation patterns.
Contribution
The work presents a novel correlation-based prefetcher that records and utilizes vertex access patterns to enhance prefetching in irregular, evolving graph workloads.
Findings
Achieves 1.5x speedup over prior best prefetchers.
Attains 62% accuracy and coverage in prefetching.
Outperforms VLDP with higher accuracy and coverage.
Abstract
Modern memory hierarchies work well with applications that have good spatial locality. Evolving (dynamic) graphs are important applications widely used to model graphs and networks with edge and vertex changes. They exhibit irregular memory access patterns and suffer from a high miss ratio and long miss penalty. Prefetching can be employed to predict and fetch future demand misses. However, current hardware prefetchers can not efficiently predict for applications with irregular memory accesses. In evolving graph applications, vertices that do not change during graph changes exhibit the same access correlation patterns. Current temporal prefetchers use one-to-one or one-to-many correlation to exploit these patterns. Similar patterns are recorded in the same entry, which causes aliasing and can lead to poor prefetch accuracy and coverage. This work proposes a software-assisted hardware…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Advanced Graph Neural Networks · Data Mining Algorithms and Applications
