ReGraph: Scaling Graph Processing on HBM-enabled FPGAs with Heterogeneous Pipelines
Xinyu Chen, Yao Chen, Feng Cheng, Hongshi Tan, Bingsheng He and, Weng-Fai Wong

TL;DR
ReGraph introduces a heterogeneous FPGA architecture with specialized pipelines for dense and sparse graph partitions, significantly improving scalability and efficiency in HBM-enabled FPGAs for graph processing.
Contribution
The paper presents a novel heterogeneous pipeline architecture and a model-guided scheduling method, along with an automated framework, to enhance FPGA-based graph processing with HBM.
Findings
ReGraph achieves up to 5.9x performance improvement over state-of-the-art.
ReGraph improves resource efficiency by up to 12x.
The heterogeneous architecture effectively scales with limited resources.
Abstract
The use of FPGAs for efficient graph processing has attracted significant interest. Recent memory subsystem upgrades including the introduction of HBM in FPGAs promise to further alleviate memory bottlenecks. However, modern multi-channel HBM requires much more processing pipelines to fully utilize its bandwidth potential. Existing designs do not scale well, resulting in underutilization of the HBM facilities even when all other resources are fully consumed. In this paper, we re-examined the graph processing workloads and found much diversity in processing. We also found that the diverse workloads can be easily classified into two types, namely dense and sparse partitions. This motivates us to propose a resource-efficient heterogeneous pipeline architecture. Our heterogeneous architecture comprises of two types of pipelines: Little pipelines to process dense partitions with good…
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
TopicsNetwork Packet Processing and Optimization · Parallel Computing and Optimization Techniques · Graph Theory and Algorithms
