HongTu: Scalable Full-Graph GNN Training on Multiple GPUs (via communication-optimized CPU data offloading)
Not on the map. Why?
Abstract (arXiv)
Full-graph training on graph neural networks (GNN) has emerged as a promising training method for its effectiveness. Full-graph training requires extensive memory and computation resources. To accelerate this training process, researchers have proposed employing multi-GPU processing. However the scalability of existing frameworks is limited as they necessitate maintaining the training data for every layer in GPU memory. To efficiently train on large graphs, we present HongTu, a scalable full-graph GNN training system running on GPU-accelerated platforms. HongTu stores vertex data in CPU memory and offloads training to GPUs. HongTu employs a memory-efficient full-graph training framework that reduces runtime memory consumption by using partition-based training and recomputation-caching-hybrid intermediate data management. To address the issue of increased host-GPU communication caused by duplicated neighbor access among partitions, HongTu employs a deduplicated communication framework that converts the redundant host-GPU communication to efficient inter/intra-GPU data access. Further, HongTu uses a cost model-guided graph reorganization method to minimize communication overhead. Experimental results on a 4XA100 GPU server show that HongTu effectively supports billion-scale full-graph GNN training while reducing host-GPU data communication by 25%-71%. Compared to the full-graph GNN system DistGNN running on 16 CPU nodes, HongTu achieves speedups ranging from 7.8X to 20.2X. For small graphs where the training data fits into the GPUs, HongTu achieves performance comparable to existing GPU-based GNN systems.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Nov 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 1.
5 papers.
- 2024Graph Neural Network Training Systems: A Performance Comparison of Full-Graph and Mini-Batchcited by 10
- 2024Reducing Memory Contention and I/O Congestion for Disk-based GNN Trainingcited by 1
- 2025OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Taskscited by 0
- 2025AIRES: Accelerating Out-of-Core GCNs via Algorithm-System Co-Designcited by 0
- 2026EmbedPart: Embedding-Driven Graph Partitioning for Scalable Graph Neural Network Trainingcited by 0
- 2026EmbedPart: Embedding-Driven Graph Partitioning for Scalable Graph Neural Network Training1 Apr 2026
- 2025AIRES: Accelerating Out-of-Core GCNs via Algorithm-System Co-Design2 Jul 2025
- 2025OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks1 Jan 2025
- 2024Reducing Memory Contention and I/O Congestion for Disk-based GNN Training20 Jun 2024
- 2024Graph Neural Network Training Systems: A Performance Comparison of Full-Graph and Mini-Batch1 Jun 2024