Reducing Communication in Graph Neural Network Training
- Presentation by Alok Tripathy (UC Berkeley) for the SC’20 paper:
Alok Tripathy, Katherine Yelick, and Aydin Buluç. Reducing communication in graph neural network training. In Proceedings of the ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2020.
- Preprint: https://arxiv.org/abs/2005.03300
- Code (CAGNET: Communication-Avoiding Graph Neural nETworks): https://github.com/PASSIONLab/CAGNET
Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks.
We introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1.5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.