EUVIMEDEUVIMED entdecken
Crossref

Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study

Nikolai Merkel, Pierre Toussing, Ruben Mayer, Hans-Arno Jacobsen

Proceedings of the VLDB Endowment · 2024-10 · 18 (2) · 293-307

DOI: 10.14778/3705829.3705846 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the VLDB Endowment, online erschienen am 28.02.2025. Verfasst von Nikolai Merkel und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 75 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph neural networks (GNNs) are a type of neural network capable of learning on graph-structured data. However, training GNNs on large-scale graphs is challenging due to iterative aggregations of high-dimensional features from neighboring vertices within sparse graph structures combined with neural network operations. The sparsity of graphs frequently results in suboptimal memory access patterns and longer training time. Graph reordering is an optimization strategy aiming to improve the graph data layout. It has shown to be effective to speed up graph analytics workloads, but its effect on the performance of GNN training has not been investigated yet. The generalization of reordering to GNN performance is nontrivial, as multiple aspects must be considered: GNN hyper-parameters such as the number of layers, the number of hidden dimensions, and the feature size used in the GNN model, neural network operations, large intermediate vertex states, and GPU acceleration. In our work, we close this gap by performing an empirical evaluation of 12 reordering strategies in two state-of-the-art GNN systems, PyTorch Geometric and Deep Graph Library. Our results show that graph reordering is effective in reducing training time for CPU- and GPU-based training, respectively. Further, we find that GNN hyper-parameters influence the effectiveness of reordering, that reordering metrics play an important role in selecting a reordering strategy, that lightweight reordering performs better for GPU-based than for CPU-based training, and that invested reordering time can in many cases be amortized.

Zitieren

APA

Merkel, N., Toussing, P., Mayer, R., & Jacobsen, H. (2024). Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study. Proceedings of the VLDB Endowment, 18(2), 293-307. https://doi.org/10.14778/3705829.3705846

Vancouver

Merkel N, Toussing P, Mayer R, Jacobsen H. Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study. Proceedings of the VLDB Endowment. 2024;18(2):293-307. doi:10.14778/3705829.3705846

BibTeX
@article{Merkel2024,
  author = {Merkel, Nikolai and Toussing, Pierre and Mayer, Ruben and Jacobsen, Hans-Arno},
  title = {Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study},
  journal = {Proceedings of the VLDB Endowment},
  year = {2024},
  volume = {18},
  number = {2},
  pages = {293--307},
  doi = {10.14778/3705829.3705846}
}
Kostenlos starten →