$$\nu$$GNN: Non-Uniformly partitioned full-graph GNN training on mixed GPUs

Abstract Graph neural networks (GNNs) can be adapted to GPUs with high computing capability due to massive arithmetic operations. Compared with mini-batch training, full-graph training does not require sampling of the input graph and halo region, avoiding potential accuracy losses. Current deep learning frameworks evenly partition large graphs to scale GNN training to distributed multi-GPU platforms. On the other hand, the rapid revolution of hardware requires technology companies and research institutions to frequently update their equipment to cope with the latest tasks. This results in a large-scale cluster with a mixture of GPUs with various computational capabilities and hardware specifications. However, existing works fail to consider sub-graphs adapted to different GPU generations, leading to inefficient resource utilization and degraded training efficiency. Therefore, we propose $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN , a Non-Uniformly partitioned full-graph GNN training framework on heterogeneous distributed platforms. $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN first models the GNN processing ability of hardware based on various theoretical parameters. Then, $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN automatically obtains a reasonable task partitioning scheme by combining hardware, model, and graph dataset information. Finally, $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN implements an irregular graph partitioning mechanism that allows GNN training tasks to execute efficiently on distributed heterogeneous systems. The experimental results show that in real-world scenarios with a mixture of GPU generations, $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN can outperform other static partitioning schemes based on hardware specifications.

Authors

Institutions

Publication Details

Journal
CCF Transactions on High Performance Computing
Published
2025-05-15
DOI
https://doi.org/10.1007/s42514-025-00224-3
Citations
1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

$$\nu$$GNN: Non-Uniformly partitioned full-graph GNN training on mixed GPUs

Qingxiao Sun, Wenqing Lin, Hemeng Wang, Weifeng Liu
1 citations
CCF Transactions on High Performance Computing
Advanced Graph Neural Networks
2.48
article

$$\nu$$GNN: Non-Uniformly partitioned full-graph GNN training on mixed GPUs

Qingxiao Sun, Wenqing Lin, Hemeng Wang, Weifeng Liu
article en
1 citations

Abstract

Abstract Graph neural networks (GNNs) can be adapted to GPUs with high computing capability due to massive arithmetic operations. Compared with mini-batch training, full-graph training does not require sampling of the input graph and halo region, avoiding potential accuracy losses. Current deep learning frameworks evenly partition large graphs to scale GNN training to distributed multi-GPU platforms. On the other hand, the rapid revolution of hardware requires technology companies and research institutions to frequently update their equipment to cope with the latest tasks. This results in a large-scale cluster with a mixture of GPUs with various computational capabilities and hardware specifications. However, existing works fail to consider sub-graphs adapted to different GPU generations, leading to inefficient resource utilization and degraded training efficiency. Therefore, we propose $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN , a Non-Uniformly partitioned full-graph GNN training framework on heterogeneous distributed platforms. $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN first models the GNN processing ability of hardware based on various theoretical parameters. Then, $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN automatically obtains a reasonable task partitioning scheme by combining hardware, model, and graph dataset information. Finally, $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN implements an irregular graph partitioning mechanism that allows GNN training tasks to execute efficiently on distributed heterogeneous systems. The experimental results show that in real-world scenarios with a mixture of GPU generations, $$\nu$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ν</mml:mi> </mml:math> GNN can outperform other static partitioning schemes based on hardware specifications.

CCF Transactions on High Performance ComputingVol. 7(4)
China University of Petroleum, Beijing (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 10%
Advanced Graph Neural Networks
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.