通过协同调度显卡与张量核心,显著提升稀疏图神经网络推理速度。
Accelerating Sparse Graph Neural Networks with Tensor Core Optimization
- 设计新型框架,让CUDA与张量核心并行工作,避免资源浪费。
- 在多个数据集上,相比主流工具提速最高达7.1倍。
- 适合需要高效部署GNN模型的工业级应用开发者。
图神经网络(GNN)在社交网络、生物信息学和推荐系统等领域广泛应用。然而,图数据的不规则性和稀疏性挑战了传统计算方法,难以满足GNN的性能需求。尽管已有研究尝试利用CUDA核和张量核进行并行加速,但仍存在两大难题:(1) 核融合导致虚假高利用率,未将两类核心视为独立资源;(2) 异构核心计算偏好不同,造成效率损失。为此,本文提出FTC-GNN,一种新型加速框架,可高效利用CUDA与张量核完成GNN计算。该框架引入两项创新:(1) 协同设计,实现两类核心的并行使用;(2) 稀疏到稠密转换策略,将稠密矩阵运算分配给张量核,利用CUDA核处理数据管理和稀疏边计算。该设计优化了GPU资源利用率,提升了计算效率。实验结果表明,使用GCN和AGNN模型在多个数据集上验证了FTC-GNN的有效性。对于GCN,相较DGL、PyG和TC-GNN分别获得4.90倍、7.10倍和1.17倍加速;对于AGNN,分别获得5.32倍、2.92倍和1.02倍加速,充分证明其在加速GNN计算方面的优势。
原文摘要 · Abstract (English)
Graph neural networks (GNNs) have seen extensive application in domains such as social networks, bioinformatics, and recommendation systems. However, the irregularity and sparsity of graph data challenge traditional computing methods, which are insufficient to meet the performance demands of GNNs. Recent research has explored parallel acceleration using CUDA Cores and Tensor Cores, but significant challenges persist: (1) kernel fusion leads to false high utilization, failing to treat CUDA and Tensor Cores as independent resources, and (2) heterogeneous cores have distinct computation preferences, causing inefficiencies. To address these issues, this paper proposes FTC-GNN, a novel acceleration framework that efficiently utilizes CUDA and Tensor Cores for GNN computation. FTC-GNN introduces (1) a collaborative design that enables the parallel utilization of CUDA and Tensor Cores and (2) a sparse-to-dense transformation strategy that assigns dense matrix operations to Tensor Cores while leveraging CUDA Cores for data management and sparse edge processing. This design optimizes GPU resource utilization and improves computational efficiency. Experimental results demonstrate the effectiveness of FTC-GNN using GCN and AGNN models across various datasets. For GCN, FTC-GNN achieves speedups of 4.90x, 7.10x, and 1.17x compared to DGL, PyG, and TC-GNN, respectively. For AGNN, it achieves speedups of 5.32x, 2.92x, and 1.02x, establishing its superiority in accelerating GNN computations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。