swMATH ID: 17478
Software Authors: J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, C. Guestrin
Description: PowerGraph: Distributed graph-parallel computation on natural graphs. 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.
Homepage: https://www.usenix.org/conference/osdi12/technical-sessions/presentation/gonzalez
Related Software: Pregel; GraphX; GraphLab; Green-Marl; SparseMatrix; Elixir; PRMLT; Ligra; SNAP; SociaLite; EmptyHeaded; CUSP; nvGRAPH; GraphBLAST; Thrust; NumPy; SuiteSparse; SympleGraph; Mermaid; PathGraph
Referenced in: 8 Publications

Referencing Publications by Year