SoGraph: A State-Aware Architecture for Out-of-Memory Graph Processing on HBM-Equipped FPGAs
Emerging FPGA devices are widely used in graph processing and achieve high performance by exploiting fine-grained parallelism and high-bandwidth memory (HBM) sub-systems with dozens of channels. However, the graph size increases rapidly and often exceeds the capacity of the FPGA device or one of the memory channels, incurring out-of-memory (OoM) faults and performance degradation. Existing approaches focus on improving the performance of on-device full graph processing, ignoring the support for hyper-scale graphs and cross-iteration acceleration. In this work, we propose SoGraph, a graph processing architecture for large graph acceleration on HBM-equipped FPGAs, cooperating with the host. To minimize PCIe traffic during the processing, we adopt three hardware-oriented optimizations: 1) activeness-driven subgraph scheduler, which minimizes on-device graph resident set; 2) lightweight state-aware processing extension in edge-centric paradigm; 3) bit-level update analyzer for to-be-transfer subgraph reduction. The results show that the prototype on Alveo U280 FPGA achieves an average of 3.18x performance speedup over the modified state-of-the-art FPGA design and 1.3x energy efficiency over the GPU solution.
Authors
- Chao Wang (ORCID: https://orcid.org/0000-0002-9403-5575)
- Lei Gong (ORCID: https://orcid.org/0000-0002-8391-5526)
- Xuehai Zhou (ORCID: https://orcid.org/0000-0002-8360-3143)
- Teng Wang (ORCID: https://orcid.org/0000-0002-7281-1203)
- Tianhao Jiang (ORCID: https://orcid.org/0009-0003-9413-4703)
- Zhendong Zheng (ORCID: https://orcid.org/0000-0002-6486-3062)
- Cheng Wei Tang (ORCID: https://orcid.org/0009-0001-3487-7957)
- Qianyu Cheng (ORCID: https://orcid.org/0000-0001-8321-6920)
Institutions
- University of Science and Technology of China (CN)
- Suzhou University of Science and Technology (CN)
Publication Details
- Published
- 2024-09-02
- DOI
- https://doi.org/10.1109/fpl64840.2024.00021
- Citations
- 1
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.25
Funders
- National Natural Science Foundation of China
- Youth Innovation Promotion Association