|
|
|
|
| LEADER |
01000caa a22002652c 4500 |
| 001 |
NLM368765784 |
| 003 |
DE-627 |
| 005 |
20250305202223.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
240229s2024 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2023.3303431
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n1228.xml
|
| 035 |
|
|
|a (DE-627)NLM368765784
|
| 035 |
|
|
|a (NLM)38386570
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Besta, Maciej
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Parallel and Distributed Graph Neural Networks
|b An In-Depth Concurrency Analysis
|
| 264 |
|
1 |
|c 2024
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 05.04.2024
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Graph neural networks (GNNs) are among the most powerful tools in deep learning. They routinely solve complex problems on unstructured networks, such as node classification, graph classification, or link prediction, with high accuracy. However, both inference and training of GNNs are complex, and they uniquely combine the features of irregular graph processing with dense and regular computations. This complexity makes it very challenging to execute GNNs efficiently on modern massively parallel architectures. To alleviate this, we first design a taxonomy of parallelism in GNNs, considering data and model parallelism, and different forms of pipelining. Then, we use this taxonomy to investigate the amount of parallelism in numerous GNN models, GNN-driven machine learning tasks, software frameworks, or hardware accelerators. We use the work-depth model, and we also assess communication volume and synchronization. We specifically focus on the sparsity/density of the associated tensors, in order to understand how to effectively apply techniques such as vectorization. We also formally analyze GNN pipelining, and we generalize the established Message-Passing class of GNN models to cover arbitrary pipeline depths, facilitating future optimizations. Finally, we investigate different forms of asynchronicity, navigating the path for future asynchronous parallel GNN pipelines. The outcomes of our analysis are synthesized in a set of insights that help to maximize GNN performance, and a comprehensive list of challenges and opportunities for further research into efficient GNN computations. Our work will help to advance the design of future GNNs
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Hoefler, Torsten
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 46(2024), 5 vom: 01. Mai, Seite 2584-2606
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnas
|
| 773 |
1 |
8 |
|g volume:46
|g year:2024
|g number:5
|g day:01
|g month:05
|g pages:2584-2606
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2023.3303431
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 46
|j 2024
|e 5
|b 01
|c 05
|h 2584-2606
|