CUTTANA: Scalable Graph Partitioning for Faster Distributed Graph Databases and Analytics
Milad Rezaei Hajidehi, Sraavan Sridhar, Margo I. Seltzer
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper12
- P3: Distributed Deep Graph Learning at ScaleSwapnil Gandhi, Anand Padmanabha IyerOSDI 2021 · 被引用 192 次
- GNNAdvisor: An Adaptive and Efficient Runtime System for GNN Acceleration on GPUsYuke Wang, Boyuan Feng, Gushu Li, Shuangchen Li 等OSDI 2021 · 被引用 163 次
- Application Driven Graph PartitioningWenfei Fan, Ruochun Jin, Muyang Liu, Ping Lu 等SIGMOD 2020 · 被引用 54 次
- G-thinker: A Distributed Framework for Mining Subgraphs in a Big GraphDa Yan, Guimu Guo, Md Mashiur Rahman Chowdhury, M. Tamer Özsu 等ICDE 2020 · 被引用 48 次
- Incrementalization of Graph Partitioning AlgorithmsWenfei Fan, Muyang Liu, Chao Tian, Ruiqi Xu 等VLDB 2020 · 被引用 47 次
相关 Paper
- Clustering-based Partitioning for Large Web GraphsDeyu Kong, Xike Xie, Zhuoxu ZhangICDE 2022 · 被引用 22 次
- Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory ConstraintsRuben Mayer, Hans-Arno JacobsenSIGMOD 2021 · 被引用 29 次
- Play like a Vertex: A Stackelberg Game Approach for Streaming Graph PartitioningZezhong Ding, Yongan Xiang, Shangyou Wang, Xike Xie 等SIGMOD 2024 · 被引用 15 次
- SASPAR: Shared Adaptive Stream PartitioningJeyhun Karimov, Hans-Arno JacobsenICDE 2023 · 被引用 3 次
- Terrace: A Hierarchical Graph Container for Skewed Dynamic GraphsPrashant Pandey, Brian Wheatman, Helen Xu, Aydin BuluçSIGMOD 2021 · 被引用 53 次
