Scalable and High Performance Betweenness Centrality on the GPU

Citations Over TimeTop 1% of 2014 papers

Abstract

Graphs that model social networks, numerical simulations, and the structure of the Internet are enormous and cannot be manually inspected. A popular metric used to analyze these networks is between ness centrality, which has applications in community detection, power grid contingency analysis, and the study of the human brain. However, these analyses come with a high computational cost that prevents the examination of large graphs of interest. Prior GPU implementations suffer from large local data structures and inefficient graph traversals that limit scalability and performance. Here we present several hybrid GPU implementations, providing good performance on graphs of arbitrary structure rather than just scale-free graphs as was done previously. We achieve up to 13x speedup on high-diameter graphs and an average of 2.71x speedup overall over the best existing GPU algorithm. We observe near linear speedup and performance exceeding tens of GTEPS when running between ness centrality on 192 GPUs.

Related Papers

• → Comparing Analysis Study of Centrality Indices using Paper Information on Secondary Battery(2015)10 cited
• → Betweeness-Centrality of Grid Networks(2009)19 cited
• → Lightweight Centrality Measures in Networks under Attack(2006)11 cited
• → A Study of Centrality Measures in SNA(2017)2 cited
• → Community-Consideration Centrality, a Case Study of Lung Cancer Proteins(2023)2 cited