Improving the efficiency of graph algorithm executions on high‐performance computing
Summary The growing need for extracting information from large graphs has been pushing the development of parallel graph algorithms. However, the highly irregular structure of the real‐world graphs limits the performance and energy improvements of graph applications. In this paper, we show that, in...
Uložené v:
| Vydané v: | Concurrency and computation Ročník 35; číslo 18 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Hoboken
Wiley Subscription Services, Inc
15.08.2023
|
| Predmet: | |
| ISSN: | 1532-0626, 1532-0634 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!