arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.10768cs.DB
收藏

FAST:基于FPGA的海量图的子图匹配

FAST: FPGA-based Subgraph Matching on Massive Graphs

Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, You Peng

摘要:

子图匹配是广泛应用于许多应用中的基本操作。然而,由于其NP-困难和爆炸式增长的图数据,它是具有挑战性的计算子图匹配,特别是在大型图。在本文中,我们的目标是扩大子图匹配在一台机器上使用FPGA。具体来说,我们提出了一个CPU-FPGA协同设计的框架。在CPU端,我们首先开发了一种新的辅助数据结构,称为候选搜索树(CST),作为一个完整的搜索空间的子图匹配。CST可以被分割并完全加载到FPGA的片内存储器中。然后,提出了一种工作负载估计技术,以平衡CPU和FPGA之间的负载。在FPGA方面,我们设计并实现了第一个基于FPGA的子图匹配算法FAST。为了充分利用FPGA的流水线机制,提出了FAST的任务并行优化和任务生成器分离策略,实现了大规模并行。此外,我们精心开发了一个BRAM匹配过程,充分利用FPGA的片上存储器,这避免了昂贵的FPGA的BRAM和DRAM之间的中间数据传输。综合实验结果表明,FAST算法相对于最先进的并行计算算法EQUIPMENT和CECI分别达到了462.0倍和150.0倍的加速比。此外,FAST是我们实验中唯一一个可以用一台机器处理十亿级图的算法。

英文摘要:

Subgraph matching is a basic operation widely used in many applications. However, due to its NP-hardness and the explosive growth of graph data, it is challenging to compute subgraph matching, especially in large graphs. In this paper, we aim at scaling up subgraph matching on a single machine using FPGAs. Specifically, we propose a CPU-FPGA co-designed framework. On the CPU side, we first develop a novel auxiliary data structure called candidate search tree (CST) which serves as a complete search space of subgraph matching. CST can be partitioned and fully loaded into FPGAs' on-chip memory. Then, a workload estimation technique is proposed to balance the load between the CPU and FPGA. On the FPGA side, we design and implement the first FPGA-based subgraph matching algorithm, called FAST. To take full advantage of the pipeline mechanism on FPGAs, task parallelism optimization and task generator separation strategy are proposed for FAST, achieving massive parallelism. Moreover, we carefully develop a BRAM-only matching process to fully utilize FPGA's on-chip memory, which avoids the expensive intermediate data transfer between FPGA's BRAM and DRAM. Comprehensive experiments show that FAST achieves up to 462.0x and 150.0x speedup compared with the state-of-the-art algorithm DAF and CECI, respectively. In addition, FAST is the only algorithm that can handle the billion-scale graph using one machine in our experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑