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...

Full description

Bibliographic Details

Published in:	The VLDB journal Vol. 32; no. 1; pp. 149 - 172
Main Authors:	Fan, Wenfei, Xu, Ruiqi, Yin, Qiang, Yu, Wenyuan, Zhou, Jingren
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2023 Springer Nature B.V
Subjects:	Algorithms Communication Computer Science Database Management Graphs Partitioning Performance enhancement Polynomials Regular Paper Workloads Graph partition Machine learning
ISSN:	1066-8888, 0949-877X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!