Alleviating datapath conflicts and design centralization in graph analytics acceleration
Haiyang Lin, Mingyu Yan, Duo Wang, Mo Zou, Fengbin Tu, Xiaochun Ye, Dongrui Fan, Yuan Xie
Abstract
Previous graph analytics accelerators have achieved great improvement on throughput by alleviating irregular off-chip memory accesses. However, on-chip side datapath conflicts and design centralization have become the critical issues hindering further throughput improvement. In this paper, a general solution, Multiple-stage Decentralized Propagation network (MDP-network), is proposed to address these issues, inspired by the key idea of trading latency for throughput. Besides, a novel High throughput Graph analytics accelerator, HiGraph, is proposed by deploying MDP-network to address each issue in practice. The experiment shows that compared with state-of-the-art accelerator, HiGraph achieves up to 2.2× speedup (1.5× on average) as well as better scalability.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on2
Related papers
- LCCG: a locality-centric hardware accelerator for high throughput of concurrent graph processingJin Zhao, Yu Zhang, Xiaofei Liao, Ligang He et al.SC 2021 · 8 citations
- NOVA: A Novel Vertex Management Architecture for Scalable Graph ProcessingMarjan Fariborz, Mahyar Samani, Austin York, S. J. Ben Yoo et al.HPCA 2025 · 2 citations
- TDGraph: a topology-driven accelerator for high-performance streaming graph processingJin Zhao, Yun Yang, Yu Zhang, Xiaofei Liao et al.ISCA 2022 · 28 citations
- Hardware Acceleration of Graph Neural NetworksAdam Auten, Matthew Tomei, Rakesh KumarDAC 2020 · 108 citations
- DepGraph: A Dependency-Driven Accelerator for Efficient Iterative Graph ProcessingYu Zhang, Xiaofei Liao, Hai Jin, Ligang He et al.HPCA 2021 · 35 citations
