Cited By
View all- Cui HYang DZhou C(2024)A large-scale graph partition algorithm with redundant multi-order neighbor vertex storageInformation Sciences: an International Journal10.1016/j.ins.2024.120473667:COnline publication date: 1-May-2024
Big graph partitioning
Abstract
At many levels, from storage infrastructures to programming paradigms, billion-node graphs pose considerable obstacles. It is necessary to provide a general-purpose graph-processing platform. A distributed memory system is thought to be a viable platform for both on-line and offline query processing and graph analytics. In this research, we look at how to partition a billion-node graph on such a platform, which is crucial because it affects load balancing and communication overhead directly. It's difficult not only because the graph is vast, but also because we can't assume that the data can be structured in any way to maximize the partitioning algorithm's speed. Instead, the algorithm must follow the system's and other applications' data and programming models. We present a multi-level label propagation (MLP) method for graph partitioning in this paper.
References
[3]
D.R. Zerbino, et al., Velvet: algorithms for de novo short read assembly using de bruijn graphs, Genome Research 18 (5) (2008) 821–829.
[4]
B. Kernighan, et al., An efficient heuristic procedure for partitioning graphs, Bell Systems Journal 49 (1972) 291–307.
[5]
C. M. Fiduccia et al., “A linear-time heuristic for improving network partitions,” in DAC' 82
[6]
B. Hendrickson et al., “The chaco user's guid, version 2.0,” Technical Report SAND94-2692, Sandia National Laboratories.
[7]
G. Karypis, et al., Metis - unstructured graph partitioning and sparse matrix ordering system, version 2.0, Tech. Rep. (1995).
[8]
G. Karypis et al., “Analysis of multilevel graph partitioning,” inSupercomputing \x9295.
[9]
G. Karypis, et al., A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, J. Parallel Distrib. Comput. 48 (1998) 71–95.
[10]
C. Chevalier, et al., Pt-scotch: A tool for efficient parallel graph ordering, Parallel Comput 34 (2008) 318–331.
[11]
A. Lumsdaine, et al., Challenges in parallel graph processing, Parallel Processing Letters: (2007) 5–20.
[12]
K. Munagala et al., “I/O-complexity of graph algorithms,” in SODA \x9299
[13]
G. Malewicz et al., \x93Pregel: a system for large-scale graph processing,\x94 in SIGMOD \x9210
[14]
A. Abou-Rjeili et al., \x93Multilevel algorithms for partitioning power-law graphs,\x94 in IPDPS \x9206
[15]
B. Shao et al., ”The trinity graph engine,” Microsoft Technique Report, MSR-TR-2012-30.
[16]
P. Erdo˝s, et al., Graphs with prescribed degrees of vertices (hungarian), Mat. Lapok 11 (1960) 264–274.
Index Terms
- Big graph partitioning
Index terms have been assigned to the content through auto-classification.
Recommendations
Partitioning of a graph into induced subgraphs not containing prescribed cliques
AbstractLet K p be a complete graph of order p ≥ 2. A K p-free k-coloring of a graph H is a partition of V ( H ) into V 1 , V 2 … , V k such that H [ V i ] does not contain K p for each i ≤ k. In 1977 Borodin and Kostochka conjectured that any graph H ...
Partitioning a Graph into Complementary Subgraphs
WALCOM: Algorithms and ComputationAbstractIn the Partition Into Complementary Subgraphs (Comp-Sub) problem we are given a graph , and an edge set property , and asked whether G can be decomposed into two graphs, H and its complement , for some graph H, in such a way that the edge cut-set (...
An investigation of big graph partitioning methods for distribution of graphs in vertex-centric systems
AbstractRelations among data entities in most big data sets can be modeled by a big graph. Implementation and execution of algorithms related to the structure of big graphs is very important in different fields. Because of the inherently high volume of ...
Comments
Information & Contributors
Information
Published In
Copyright © 2022.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 January 2022
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 07 Nov 2024
Other Metrics
Citations
Cited By
View all- Cui HYang DZhou C(2024)A large-scale graph partition algorithm with redundant multi-order neighbor vertex storageInformation Sciences: an International Journal10.1016/j.ins.2024.120473667:COnline publication date: 1-May-2024
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in