The Community for Technology Leaders
2017 IEEE International Conference on Cluster Computing (CLUSTER) (2017)
Honolulu, Hawaii, United States
Sept. 5, 2017 to Sept. 8, 2017
ISSN: 2168-9253
ISBN: 978-1-5386-2326-8
pp: 657-658
ABSTRACT
The rapidly growing number of large network analysis problems has led to the emergence of many parallel and distributed graph processing systems—one survey in 2014 identified over 80. Determining the best approach for a given problem is infeasible for most developers. We present an approach and associated software for analyzing the performance and scalability of parallel, open-source graph libraries. We demonstrate our approach on five graph processing packages: GraphMat, Graph500, Graph Algorithm Platform Benchmark Suite, GraphBIG, and PowerGraph using synthetic and real-world datasets. We examine previously overlooked aspects of parallel graph processing performance such as phases of execution and energy usage for three algorithms: breadth first search, single source shortest paths, and PageRank.
INDEX TERMS
Benchmark testing, Software algorithms, Algorithm design and analysis, Libraries, Software packages, Programming, Power demand
CITATION

S. D. Pollard and B. Norris, "A Comparison of Parallel Graph Processing Implementations," 2017 IEEE International Conference on Cluster Computing (CLUSTER), Honolulu, Hawaii, United States, 2017, pp. 657-658.
doi:10.1109/CLUSTER.2017.56
89 ms
(Ver 3.3 (11022016))