A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

Madduri, Kamesh ; Ediger, David ; Jiang, Karl ; Bader, David A. ; Chavarria-Miranda, Daniel

关键词: 97;    ALGORITHMS;    BENCHMARKS;    DESIGN;    IMPLEMENTATION;    KERNELS;    PERFORMANCE graph algorithms;    multithreading;    betweenness centrality;    network analysis;   

DOI  :  10.2172/951102
RP-ID  :  LBNL-1703E
PID  :  OSTI ID: 951102
Others  :  TRN: US200911%%444

美国|英语

来源: SciTech Connect

【 摘 要 】

We present a new lock-free parallel algorithm for computing betweenness centralityof massive small-world networks. With minor changes to the data structures, ouralgorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the Threadstorm processor, and a single-socket Sun multicore server with the UltraSPARC T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.