A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

Authors:
Kamesh Madduri;David Ediger;Karl Jiang;David A. Bader;Daniel Chavarria-Miranda
Affiliations:
Computational Research Division, Lawrence Berkeley National Laboratory, CA, USA;College of Computing, Georgia Institute of Technology, Atlanta, USA;College of Computing, Georgia Institute of Technology, Atlanta, USA;College of Computing, Georgia Institute of Technology, Atlanta, USA;High Performance Computing, Pacific Northwest National Laboratory, Richland, WA, USA
Venue:
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Year:
2009

Citing 0
Cited 11

Performance analysis of an algorithm for computation of betweenness centrality

ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
The Combinatorial BLAS: design, implementation, and applications

International Journal of High Performance Computing Applications
An OpenMP algorithm and implementation for clustering biological graphs

Proceedings of the first workshop on Irregular applications: architectures and algorithm
Green-Marl: a DSL for easy and efficient graph analysis

ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
A novel measure of edge centrality in social networks

Knowledge-Based Systems
NUMA-aware graph mining techniques for performance and energy efficiency

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Betweenness centrality: algorithms and implementations

Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Fast Exact Computation of betweenness Centrality in Social Networks

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Betweenness centrality on GPUs and heterogeneous architectures

Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units
A GPU-based method for computing eigenvector centrality of gene-expression networks

AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
Simplifying Scalable Graph Processing with a Domain-Specific Language

Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new lock-free parallel algorithm for computing betweenness centrality of massive complex networks that achieves better spatial locality compared with previous approaches. Betweenness centrality is a key kernel in analyzing the importance of vertices (or edges) in applications ranging from social networks, to power grids, to the influence of jazz musicians, and is also incorporated into the DARPA HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph analytics. We design an optimized implementation of betweenness centrality for the massively multithreaded Cray XMT system with the Thread-storm processor. For a small-world network of 268 million vertices and 2.147 billion edges, the 16-processor XMT system achieves a TEPS rate (an algorithmic performance count for the number of edges traversed per second) of 160 million per second, which corresponds to more than a 2脳 performance improvement over the previous parallel implementation. We demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for the large IMDb movie-actor network.