Application-driven graph partitioning

Graph partitioning is crucial to parallel computations on large graphs. The choice of partitioning strategies has strong impact on the performance of graph algorithms. For an algorithm of our interest, what partitioning strategy fits it the best and improves its parallel execution? Is it possible to...

Celý popis

Podrobná bibliografia

Vydané v:	The VLDB journal Ročník 32; číslo 1; s. 149 - 172
Hlavní autori:	Fan, Wenfei, Xu, Ruiqi, Yin, Qiang, Yu, Wenyuan, Zhou, Jingren
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2023 Springer Nature B.V
Predmet:	Algorithms Communication Computer Science Database Management Graphs Partitioning Performance enhancement Polynomials Regular Paper Workloads Graph partition Machine learning
ISSN:	1066-8888, 0949-877X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!