Graph neural networks (GNNs), an emerging class of machine learning models for graphs, have gained popularity for their superior performance in various graph analytical tasks. Mini-batch training is commonly used to train GNNs on large graphs, and data parallelism is the standard approach to scale mini-batch training across multiple GPUs. Data parallel approaches contain redundant work as subgraphs sampled by different GPUs contain significant overlap. To address this issue, we introduce a hybrid parallel mini-batch training paradigm called split parallelism. Split parallelism avoids redundant work by splitting the sampling, loading, and training of each mini-batch across multiple GPUs. Split parallelism, however, introduces communication overheads that can be more than the savings from removing redundant work. We further present a lightweight partitioning algorithm that probabilistically minimizes these overheads. We implement split parallelism in GSplit and show that it outperforms state-of-the-art mini-batch training systems like DGL, Quiver, and P3.
@article{arxiv.2303.13775,
title = {GSplit: Scaling Graph Neural Network Training on Large Graphs via Split-Parallelism},
author = {Sandeep Polisetty and Juelin Liu and Kobi Falus and Yi Ren Fung and Seung-Hwan Lim and Hui Guan and Marco Serafini},
journal= {arXiv preprint arXiv:2303.13775},
year = {2025}
}
Comments
Published at MLSys 2025. OpenReview: https://openreview.net/forum?id=cTOx1YTBgh