PowerGraph: distributed graph-parallel computation on natural graphs
Joseph E. Gonzalez, Yucheng Low, Haijie Gu et al. · 2012
Large-scale graph-structured computation is central to tasks ranging from targeted advertising to natural language processing and has led to the development of several graph-parallel abstractions including Pregel and GraphLab. However, the natural graphs commonly found in the real-world have highly skewed power-law degree distributions, which challenge the assumptions made by these abstractions, limiting performance and scalability. In this paper, we characterize the challenges of computation on natural graphs in the context of existing graphparallel abstractions. We then introduce the PowerGraph abstraction which exploits the internal structure of graph programs to address these challenges. Leveraging the PowerGraph abstraction we introduce a new approach to distributed graph placement and representation that exploits the structure of power-law graphs. We provide a detailed analysis and experimental evaluation comparing PowerGraph to two popular graph-parallel systems. Finally, we describe three different implementation strategies for PowerGraph and discuss their relative merits with empirical evaluations on large-scale real-world problems demonstrating order of magnitude gains. 1
Cited by 1,451 works. doi:10.5555/2387880.2387883
Authors
References
- On power-law relationships of the Internet topology
- Error and attack tolerance of complex networks
- Parallel and Distributed Computation: Numerical Methods
- On power-law relationships of the Internet topology
- Probabilistic Latent Semantic Indexing
- What is Twitter, a social network or a news media?
- Hierarchical ordering of sequential processes
- Spark: cluster computing with working sets
- Pregel
- Distributed GraphLab