LGNNIC: Acceleration of Large-Scale GNN Training using SmartNICs
Liad Gerstman, Aditya Dhakal, Dejan Milojicic, Avi Mendelson
cs.DC, cs.AI, cs.AR, cs.LG, cs.PF
Submitted: 2026-08-07
Updated: 2026-08-11
Comments: 14 pages, 5 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Graph Neural Networks (GNNs) are widely used across domains such as natural sciences, social network analysis, chip design, and recommendation systems.
Terminology
Abstract
Graph Neural Networks (GNNs) are widely used across domains such as natural sciences, social network analysis, chip design, and recommendation systems. However, as graph sizes grow, storing and processing them entirely on a single-node CPU-GPU system becomes increasingly impractical. A promising approach is to distribute the graph across multiple remote memory nodes, though this introduces a major bottleneck: inter-node network congestion during training. To address this, we propose LGNNIC, a novel inter-node system architecture that leverages SmartNICs co-located with remote memory nodes-a configuration already available in modern systems-to reduce communication overhead in distributed GNN training. LGNNIC offloads key preprocessing tasks to SmartNICs, reducing the volume of data transferred to computational (training) nodes and alleviating network congestion. We introduce two complementary techniques executed on the SmartNICs during the preprocessing phase: Neighbor Sampling, which performs mini-batch sampling, and Quantization of the sampled batches. To evaluate LGNNIC under different communication infrastructures, we designed both an optimized low-overhead DMA-based synchronization mechanism and a high-overhead socket-based alternative used as a benchmark. We evaluate the core SmartNIC offloading mechanisms across standard GNN workloads and sampling hyperparameters using a proof-of-concept (PoC) system comprising one remote-memory node with an NVIDIA BlueField-2 SmartNIC and one compute node with an A100 GPU. Both Neighbor Sampling and Quantization on the remote node demonstrated substantial training speedups in most configurations. Neighbor Sampling achieved up to 62.4x and 17.5x speedups with Sockets and DOCA-DMA, respectively, primarily due to reduced data transaction time. Quantization provided additional speedups of up to 3.6x and 1.3x, respectively, by reducing data transfer.
Sources
- OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs
- Open Graph Benchmark: Datasets for Machine Learning on Graphs
- Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding
- Quantizing deep convolutional networks for efficient inference: A whitepaper
- FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling
- Sequential Aggregation and Rematerialization: Distributed Full-batch Training of Graph Neural Networks on Large Graphs
- GNNear: Accelerating Full-Batch Training of Graph Neural Networks with Near-Memory Processing
- Hardware Acceleration of Sampling Algorithms in Sample and Aggregate Graph Neural Networks
- HitGNN: High-throughput GNN Training Framework on CPU+Multi-FPGA Heterogeneous Platform
Related papers
- iScheduler: Reinforcement Learning-Driven Continual Optimization for Large-Scale Resource Investment Problems
- Load Balancing with Evolving Workloads in Large-Scale Language Model Serving
- Dooly: Configuration-Agnostic, Redundancy-Aware Profiling for LLM Inference Simulation
- SAMM: Sharded Automated Market Maker
- InferScale: GPU-Native KV Injection for Personalized LLM Serving
- Vigil: Accountable Liveness against Selective Silence