Revisiting Edge and Node Parallelism for Dynamic GPU Graph Analytics

Citations Over TimeTop 10% of 2014 papers

Abstract

Betweenness Centrality is a widely used graph analytic that has applications such as finding influential people in social networks, analyzing power grids, and studying protein interactions. However, its complexity makes its exact computation infeasible for large graphs of interest. Furthermore, networks tend to change over time, invalidating previously calculated results and encouraging new analyses regarding how centrality metrics vary with time. While GPUs have dominated regular, structured application domains, their high memory throughput and massive parallelism has made them a suitable target architecture for irregular, unstructured applications as well. In this paper we compare and contrast two GPU implementations of an algorithm for dynamic betweenness centrality. We show that typical network updates affect the centrality scores of a surprisingly small subset of the total number of vertices in the graph. By efficiently mapping threads to units of work we achieve up to a 110x speedup over a CPU implementation of the algorithm and can update the analytic 45x faster on average than a static recomputation on the GPU.

Related Papers

• → Shattering and Compressing Networks for Betweenness Centrality(2013)40 cited
• → Graph Manipulations for Fast Centrality Computation(2017)33 cited
• → A Node Importance Measuring Method based on Hypernetwork(2016)1 cited
• → Shattering and Compressing Networks for Centrality Analysis(2012)6 cited
• → On Visualization of Journals Reference Network Based on Force-Directed Layout Algorithms(2012)