CUTTANA: Scalable Graph Partitioning for Faster Distributed Graph Databases and Analytics
Milad Rezaei Hajidehi, Sraavan Sridhar, Margo I. Seltzer
Abstract
Graph partitioning plays a pivotal role in various distributed graph processing applications, including graph analytics, graph neural network training, and distributed graph databases. A "good" graph partitioner reduces workload execution time, worker imbalance, and network overhead. Graphs that require distributed settings are often too large to fit in the main memory of a single machine. This challenge renders traditional in-memory graph partitioners infeasible, leading to the emergence of streaming solutions. Streaming partitioners produce lower-quality partitions, because they work from partial information and must make premature decisions before they have a complete view of a vertex's neighborhood. We introduce CUTTANA, a streaming graph partitioner that partitions massive graphs (Web/Twitter scale) with superior quality compared to existing streaming solutions. CUTTANA uses a novel buffering technique that prevents the premature assignment of vertices to partitions and a scalable coarsening and refinement technique that enables a complete graph view, improving the intermediate assignment made by a streaming partitioner. We implemented a parallel version for CUTTANA that offers nearly the same partitioning latency as existing streaming partitioners. Our experimental analysis shows that CUTTANA consistently yields better partitioning quality than state-of-the-art streaming vertex partitioners in terms of both edge-cut and communication volume metrics. We also evaluate the workload latencies that result from using CUTTANA and other partitioners in distributed graph analytics and databases. CUTTANA outperforms the other methods in most scenarios (algorithms, datasets). In analytics applications, CUTTANA improves runtime performance by up to 59% compared to various streaming partitioners (i.e., HDRF, Fennel, Ginger, HeiStream). In graph database tasks, CUTTANA results in higher query throughput by up to 23%, without hurting tail latency.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b7cc4b86-a522-44dc-b4f9-20debded4561Cited by top-tier papers1
Ask how each one uses itBuilds on12
- P3: Distributed Deep Graph Learning at ScaleSwapnil Gandhi, Anand Padmanabha IyerOSDI 2021 · 192 citations
- GNNAdvisor: An Adaptive and Efficient Runtime System for GNN Acceleration on GPUsYuke Wang, Boyuan Feng, Gushu Li, Shuangchen Li et al.OSDI 2021 · 163 citations
- Application Driven Graph PartitioningWenfei Fan, Ruochun Jin, Muyang Liu, Ping Lu et al.SIGMOD 2020 · 54 citations
- G-thinker: A Distributed Framework for Mining Subgraphs in a Big GraphDa Yan, Guimu Guo, Md Mashiur Rahman Chowdhury, M. Tamer Özsu et al.ICDE 2020 · 48 citations
- Incrementalization of Graph Partitioning AlgorithmsWenfei Fan, Muyang Liu, Chao Tian, Ruiqi Xu et al.VLDB 2020 · 47 citations
Related papers
- Clustering-based Partitioning for Large Web GraphsDeyu Kong, Xike Xie, Zhuoxu ZhangICDE 2022 · 22 citations
- Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory ConstraintsRuben Mayer, Hans-Arno JacobsenSIGMOD 2021 · 29 citations
- Play like a Vertex: A Stackelberg Game Approach for Streaming Graph PartitioningZezhong Ding, Yongan Xiang, Shangyou Wang, Xike Xie et al.SIGMOD 2024 · 15 citations
- SASPAR: Shared Adaptive Stream PartitioningJeyhun Karimov, Hans-Arno JacobsenICDE 2023 · 3 citations
- Terrace: A Hierarchical Graph Container for Skewed Dynamic GraphsPrashant Pandey, Brian Wheatman, Helen Xu, Aydin BuluçSIGMOD 2021 · 53 citations
