research-article

A scalable distributed graph partitioner

Editors: Chen Li, Volker Markl Authors:

Margo SeltzerAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 8, Issue 12

Pages 1478 - 1489

https://doi.org/10.14778/2824032.2824046

Published: 01 August 2015 Publication History

Abstract

We present Scalable Host-tree Embeddings for Efficient Partitioning (Sheep), a distributed graph partitioning algorithm capable of handling graphs that far exceed main memory. Sheep produces high quality edge partitions an order of magnitude faster than both state of the art offline (e.g., METIS) and streaming partitioners (e.g., Fennel). Sheep's partitions are independent of the input graph distribution, which means that graph elements can be assigned to processing nodes arbitrarily without affecting the partition quality.

Sheep transforms the input graph into a strictly smaller elimination tree via a distributed map-reduce operation. By partitioning this tree, Sheep finds an upper-bounded communication volume partitioning of the original graph.

We describe the Sheep algorithm and analyze its space-time requirements, partition quality, and intuitive characteristics and limitations. We compare Sheep to contemporary partitioners and demonstrate that Sheep creates competitive partitions, scales to larger graphs, and has better runtime.

References

[1]

R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance of complex networks. Nature, 406(6794):378--382, 2000.

[2]

S. Arifuzzaman, M. Khan, and M. Marathe. Patric: A parallel algorithm for counting triangles in massive networks. In ACM International Conference on Information and Knowledge Management, 2013.

[3]

C. Ashcraft and J. W. Liu. Robust ordering of sparse matrices using multisection. SIAM Journal on Matrix Analysis and Applications, 19(3):816--832, 1998.

[4]

C. Avery. Giraph: Large-scale graph processing infrastructure on hadoop. Hadoop Summit, 2011.

[5]

H. L. Bodlaender, F. V. Fomin, A. M. Koster, D. Kratsch, and D. M. Thilikos. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems, 50(3):420--432, 2012.

[6]

H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Journal of Algorithms, 18(2):238--255, 1995.

[7]

P. Boldi, M. Santini, and S. Vigna. A large time-aware graph. SIGIR Forum, 42(2):33--38, 2008.

[8]

F. Bourse, M. Lelarge, and M. Vojnovic. Balanced graph edge partition. In 20th ACM International Conference on Knowledge Discovery and Data mining, pages 1456--1465. ACM, 2014.

[9]

R. Chen, J. Shi, Y. Chen, and H. Chen. Powerlyra: Differentiated graph computation and partitioning on skewed graphs. In 10th ACM SIGOPS European Conference on Computer Systems. ACM, 2015.

[10]

S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes. K-core organization of complex networks. Physical review letters, 96(4):040601, 2006.

[11]

M. Fredman and M. Saks. The cell probe complexity of dynamic data structures. In 21st ACM Symposium on Theory of Computing, pages 345--354. ACM, 1989.

[12]

A. George. Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis, 10(2):345--363, 1973.

[13]

A. George and J. W. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1--19, 1989.

[14]

J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In Operating Systems Design and Implementation, volume 12, page 2, 2012.

[15]

P. Heggernes. Minimal triangulations of graphs: A survey. Discrete Mathematics, 306(3):297--317, 2006.

[16]

S. Idreos, M. L. Kersten, and S. Manegold. Database cracking. In Conference on Innovative Data systems Research, volume 3, pages 1--8, 2007.

[17]

S. Iyer, T. Killingback, B. Sundaram, and Z. Wang. Attack robustness and centrality of complex networks. PloS ONE, 8(4):e59613, 2013.

[18]

G. Karypis. A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. University of Minnesota, Department of Computer Science and Engineering, Minneapolis, MN, 2013.

[19]

G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359--392, 1998.

[20]

G. Karypis and V. Kumar. A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. Journal of Parallel and Distributed Computing, 48(1):71--95, Jan. 1998.

[21]

S. Kundu and J. Misra. A linear tree partitioning algorithm. SIAM Journal on Computing, 6(1):151--154, 1977.

[22]

A. Kyrola, G. E. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. In Operating Systems Design and Implementation, volume 12, pages 31--46, 2012.

[23]

J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.

[24]

P. Macko, V. J. Marathe, D. W. Margo, and M. I. Seltzer. Llama: Efficient graph analytics using large multiversioned arrays. In International Conference on Data Engineering. IEEE, 2015.

[25]

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In 2010 ACM SIGMOD International Conference on Management of Data, pages 135--146. ACM, 2010.

[26]

H. Miao, X. Liu, B. Huang, and L. Getoor. A hypergraph-partitioned vertex programming approach for large-scale consensus optimization. In International Conference on Big Data, pages 563--568. IEEE, 2013.

[27]

R. C. Murphy, K. B. Wheeler, B. W. Barrett, and J. A. Ang. Introducing the graph 500. Cray User's Group (CUG), 2010.

[28]

M. E. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98(2):404--409, 2001.

[29]

S. Parter. The use of linear graphs in gauss elimination. SIAM Review, 3(2):119--130, 1961.

[30]

A. Pothen and S. Toledo. Elimination structures in scientific computing. Handbook on Data Structures and Applications, pages 59--1, 2004.

[31]

V. Prabhakaran, M. Wu, X. Weng, F. McSherry, L. Zhou, and M. Haradasan. Managing large graphs on multi-cores with graph awareness. In USENIX Annual Technical Conference, pages 41--52, 2012.

[32]

A. Roy, I. Mihailovic, and W. Zwaenepoel. X-stream: Edge-centric graph processing using streaming partitions. In 24th ACM Symposium on Operating Systems Principles, pages 472--488. ACM, 2013.

[33]

S. Salihoglu and J. Widom. Gps: A graph processing system. In 25th International Conference on Scientific and Statistical Database Management. ACM, 2013.

[34]

N. Satish, N. Sundaram, M. M. A. Patwary, J. Seo, J. Park, M. A. Hassaan, S. Sengupta, Z. Yin, and P. Dubey. Navigating the maze of graph analytics frameworks using massive graph datasets. In ACM SIGMOD International Conference on Management of Data, pages 979--990. ACM, 2014.

[35]

I. Stanton and G. Kliot. Streaming graph partitioning for large distributed graphs. In 18th ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pages 1222--1230. ACM, 2012.

[36]

C. Tsourakakis, C. Gkantsidis, B. Radunovic, and M. Vojnovic. Fennel: Streaming graph partitioning for massive scale graphs. In 7th ACM International Conference on Web Search and Data Mining, pages 333--342. ACM, 2014.

Cited By

Ding ZKong DZhang ZXie XXu J(2025)ClusPar: A Game-Theoretic Approach for Efficient and Scalable Streaming Edge PartitioningIEEE Transactions on Computers10.1109/TC.2024.347556874:1(116-130)Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1109/TC.2024.3475568
Shi MPeng PZhou XLiu JXiao GLi K(2024)Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query ProcessingProceedings of the ACM on Management of Data10.1145/36988042:6(1-26)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698804
Xu JMing YWu ZWang CJia X(2024)X-Shard: Optimistic Cross-Shard Transaction Processing for Sharding-Based BlockchainsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.336118035:4(548-559)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1109/TPDS.2024.3361180
Show More Cited By

A scalable distributed graph partitioner
1. Information systems
  1. Data management systems
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

A parallel graph partitioner on a distributed memory multiprocessor
FRONTIERS '95: Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)

In order to realize the full potential of speed-up by parallelization, it is essential to partition a problem into small tasks with minimal interactions without making this process itself a bottleneck. We present a method for graph partitioning that is ...
G-kway: Multilevel GPU-Accelerated k-way Graph Partitioner
DAC '24: Proceedings of the 61st ACM/IEEE Design Automation Conference

Graph partitioning is important for the design of many CAD algorithms. However, as the graph size continues to grow, graph partitioning becomes increasingly time-consuming. To overcome these challenges, we propose G-kway, an efficient multilevel GPU-...
Hammer lightweight graph partitioner based on graph data volumes
Highlights
- Graph partitioning is a challenging task for the massive graphs in distributed computing.
Abstract
The graph partitioning challenge is well known and ongoing classical problem. Many heuristic methods tried to propose solutions focusing mainly on load processing and cost-efficiency. With the emergency of big data technology, the ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 8, Issue 12

Proceedings of the 41st International Conference on Very Large Data Bases, Kohala Coast, Hawaii

August 2015

728 pages

ISSN:2150-8097

Editors:
Chen Li
University of California, Irvine
,
Volker Markl
TU Berlin

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 August 2015

Published in PVLDB Volume 8, Issue 12

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
385
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)2

Reflects downloads up to 24 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ding ZKong DZhang ZXie XXu J(2025)ClusPar: A Game-Theoretic Approach for Efficient and Scalable Streaming Edge PartitioningIEEE Transactions on Computers10.1109/TC.2024.347556874:1(116-130)Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1109/TC.2024.3475568
Shi MPeng PZhou XLiu JXiao GLi K(2024)Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query ProcessingProceedings of the ACM on Management of Data10.1145/36988042:6(1-26)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698804
Xu JMing YWu ZWang CJia X(2024)X-Shard: Optimistic Cross-Shard Transaction Processing for Sharding-Based BlockchainsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.336118035:4(548-559)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1109/TPDS.2024.3361180
Ji SBu CLi LWu X(2024)LocalTGEP: A Lightweight Edge Partitioner for Time-Varying GraphIEEE Transactions on Emerging Topics in Computing10.1109/TETC.2023.323833312:2(455-466)Online publication date: Apr-2024
https://doi.org/10.1109/TETC.2023.3238333
Shi CXie Z(2024)PECC: parallel expansion based on clustering coefficient for efficient graph partitioningDistributed and Parallel Databases10.1007/s10619-024-07442-842:4(447-467)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1007/s10619-024-07442-8
Zheng JLu YZheng W(2024)Distributed k-Hop Query Powered by an Asynchronous FrameworkWeb Information Systems Engineering – WISE 202410.1007/978-981-96-0579-8_22(304-319)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1007/978-981-96-0579-8_22
Wang SZhang MYang KChen KMa SJiang JWu YAamodt TJerger NSwift M(2023)NosWalker: A Decoupled Architecture for Out-of-Core Random Walk ProcessingProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3582016.3582025(466-482)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3582016.3582025
Zhang ZQu WZhang WShang JWang X(2023)A Mixed-State Streaming Edge Partitioning based on Combinatorial Design2023 IEEE International Conference on Data Mining (ICDM)10.1109/ICDM58522.2023.00096(868-877)Online publication date: 1-Dec-2023
https://doi.org/10.1109/ICDM58522.2023.00096
Merkel NMayer RFakir TJacobsen H(2023)Partitioner Selection with EASE to Optimize Distributed Graph Processing2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00185(2400-2414)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00185
Qu WZhang WCheng JZhang CHan WBai BZhang CHe LWang X(2023)Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic Approach2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00083(1019-1031)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00083
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents