Systems for Graph Neural Networks

In-GPU sampling and training, distributed multi-GPU systems

Representation learning is a fundamental task in machine learning. It consists of learning the features of data items automatically, typically using a deep neural network (DNN), instead of selecting hand-engineered features that typically have worse performance. Graph data requires specific algorithms for representation learning such as DeepWalk, node2vec, and GraphSAGE. These algorithms first sample the input graph and then train a DNN based on the samples. It is common to use GPUs for training, but graph sampling on GPUs is challenging. Sampling is an embarrassingly parallel task since each sample can be generated independently. However, the irregularity of graphs makes it hard to use GPU resources effectively. Existing graph processing, mining, and representation learning systems do not effectively parallelize sampling and this negatively impacts the end-to-end performance of representation learning.

We developed NextDoor, the first system specifically designed to perform graph sampling on GPUs. NextDoor introduces a high-level API based on a novel paradigm for parallel graph sampling called transit-parallelism. We implement several graph sampling applications, and show that NextDoor runs them orders of magnitude faster than existing systems

Our current work is on split-parallelism, a novel hybrid parallelism strategies for mini-batch training. The traditional data parallel approach poses inherent limitations to scalable GNN training because it introduces redundant data loading and computation. Rather than proposing incremental patches to that paradigm, as done by previous work, this project proposes a fundamental shift towards a new paradigm for GNN training called split parallelism. The main idea is to split the computation of mini-batches across multiple GPUs, which cooperatively perform each iteration. Split parallelism scales the size of the cache when the number of GPUs in the system grows and maximizes cache access locality, which results in much better performance also in smaller models.

References

2023

  1. GSplit: Scaling Graph Neural Network Training on Large Graphs via Split-Parallelism
    Sandeep Polisetty, Juelin Liu, Kobi Falus, Yi Ren Fung, Seung-Hwan Lim, Hui Guan, and Marco Serafini
    arXiv preprint arXiv:2303.13775, 2023

2021

  1. Accelerating Graph Sampling for Graph Machine Learning Using GPUs
    Abhinav Jangda, Sandeep Polisetty, Arjun Guha, and Marco Serafini
    In Proceedings of the Sixteenth European Conference on Computer Systems (Eurosys), 2021
  2. Scalable Graph Neural Network Training: The Case for Sampling
    Marco Serafini, and Hui Guan
    ACM SIGOPS Operating Systems Review, 2021