Cut to Fit: Tailoring the Partitioning to the Computation
Iacovos Kolokasis, Polyvios Pratikakis

TL;DR
This paper explores how customizing graph partitioning strategies based on specific social graph datasets and analytics algorithms can significantly improve performance, challenging the one-size-fits-all approach of standard frameworks.
Contribution
It provides an analysis of how different partitioning algorithms affect social graph analytics performance, emphasizing the importance of dataset and algorithm-aware optimization.
Findings
Communication cost predicts performance for most algorithms
Different algorithms require different optimal partitioning strategies
General optimization may not suit specific graph algorithms
Abstract
Social Graph Analytics applications are very often built using off-the-shelf analytics frameworks. These, however, are profiled and optimized for the general case and have to perform for all kinds of graphs. This paper investigates how knowledge of the application and the dataset can help optimize performance with minimal effort. We concentrate on the impact of partitioning strategies on the performance of computations on social graphs. We evaluate six graph partitioning algorithms on a set of six social graphs, using four standard graph algorithms by measuring a set of five partitioning metrics. We analyze the performance of each partitioning strategy with respect to (i) the properties of the graph dataset, (ii) each analytics computation,of partitions. We discover that communication cost is the best predictor of performance for most -but not all- analytics computations. We also find…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Interconnection Networks and Systems · Digital Image Processing Techniques
