paperbot · PL 论文追踪

全部论文 待读 收藏

P2 FastGL: A GPU-Efficient Framework for Accelerating Sampling-Based GNN Training at Large Scale

FastGL:一种用于大规模加速基于采样的 GNN 训练的 GPU 高效框架
ASPLOS Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 42024匹配度 1/10 · 该论文聚焦于大规模 GNN 采样训练的 GPU 系统优化,属于机器学习系统/运行时内存管理方向,并未涉及用户核心关注的静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析。虽然标签包含“机器学习与程序语言”,但实际内容与 PL 及 LLM 交叉方向几乎没有直接关联。引用 10 inbox
Zeyu Zhu, Peisong Wang, Qinghao Hu, Gang Li, Xiaoyao Liang, Jian Cheng
crossref: 2026-09-12dblp: 2026-09-12arxiv: 2026-09-12

AI 速览

一句话:提出 FastGL,协同优化子图采样、内存 IO 与 GPU 计算,平均加速现有 GNN 训练框架。

基于采样的训练是扩展到十亿级节点/边大图 GNN 的常用方案,但现有框架在子图采样、内存 IO 和计算三个阶段均存在瓶颈。FastGL 同时优化这三个阶段:用 Match-Reorder 利用图结构中的数据重叠减少数据流量,在不增加 GPU 显存开销的前提下加速内存 IO;用 Memory-Aware 计算利用 GPU 内存层级缓解不规则访存;用 Fused-Map 降低采样过程中的同步开销。实验表明,FastGL 相比最先进框架 PyG、DGL 和 GNNLab 分别取得平均 11.8×、2.2× 和 1.5× 的加速。

问题
如何高效地将基于采样的 GNN 训练扩展到十亿级节点和边的大图,并突破采样、内存 IO 与计算三阶段的性能瓶颈。
方法
提出 FastGL,通过 Match-Reorder、Memory-Aware 计算与 Fused-Map 三项技术协同优化子图采样、内存访问与计算,并兼顾 GPU 特性与图结构。
评估
在真实大规模图数据上,与 PyG、DGL、GNNLab 等最先进框架对比,平均加速分别为 11.8×、2.2× 和 1.5×。
原文摘要(Abstract)

Graph Neural Networks (GNNs) have shown great superiority on non-Euclidean graph data, achieving ground-breaking performance on various graph-related tasks. As a practical solution to train GNN on large graphs with billions of nodes and edges, the sampling-based training is widely adopted by existing training frameworks. However, through an in-depth analysis, we observe that the efficiency of existing sampling-based training frameworks is still limited due to the key bottlenecks lying in all three phases of sampling-based training, i.e., subgraph sample, memory IO, and computation. To this end, we propose FastGL, a GPU-efficient Framework for accelerating sampling-based training of GNN at Large scale by simultaneously optimizing all above three phases, taking into account both GPU characteristics and graph structure. Specifically, by exploiting the inherent overlap within graph structures, FastGL develops the Match-Reorder strategy to reduce the data traffic, which accelerates the memory IO without incurring any GPU memory overhead. Additionally, FastGL leverages a Memory-Aware computation method, harnessing the GPU memory's hierarchical nature to mitigate irregular data access during computation. FastGL further incorporates the Fused-Map approach aimed at diminishing the synchronization overhead during sampling. Extensive experiments demonstrate that FastGL can achieve an average speedup of 11.8×, 2.2× and 1.5× over the state-of-the-art frameworks PyG, DGL, and GNNLab, respectively. Our code is available at https://github.com/a1bc2def6g/fastgl-ae.

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@inproceedings{ZhuWHLL024,
  title = {FastGL: A GPU-Efficient Framework for Accelerating Sampling-Based GNN Training at Large Scale},
  author = {Zeyu Zhu and Peisong Wang and Qinghao Hu and Gang Li and Xiaoyao Liang and Jian Cheng},
  booktitle = {ASPLOS},
  year = {2024},
  doi = {10.1145/3622781.3674167}
}