| Title | Efficient Parallel Algorithms for Computing Percolation Centrality |
| Publication Type | Conference Paper |
| Year of Publication | 2021 |
| Authors | Chandramouli, Athreya, Jana, Sayantan, Kothapalli, Kishore |
| Conference Name | 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC) |
| Date Published | dec |
| Keywords | Computing Theory, Conferences, Gain measurement, graphics processing units, High performance computing, Metrics, pubcrawl, security metrics, Silver, social networking (online), Transportation |
| Abstract | Centrality measures on graphs have found applications in a large number of domains including modeling the spread of an infection/disease, social network analysis, and transportation networks. As a result, parallel algorithms for computing various centrality metrics on graphs are gaining significant research attention in recent years. In this paper, we study parallel algorithms for the percolation centrality measure which extends the betweenness-centrality measure by incorporating a time dependent state variable with every node. We present parallel algorithms that compute the source-based and source-destination variants of the percolation centrality values of nodes in a network. Our algorithms extend the algorithm of Brandes, introduce optimizations aimed at exploiting the structural properties of graphs, and extend the algorithmic techniques introduced by Sariyuce et al. [26] in the context of centrality computation. Experimental studies of our algorithms on an Intel Xeon(R) Silver 4116 CPU and an Nvidia Tesla V100 GPU on a collection of 12 real-world graphs indicate that our algorithmic techniques offer a significant speedup. |
| DOI | 10.1109/HiPC53243.2021.00025 |
| Citation Key | chandramouli_efficient_2021 |
Efficient Parallel Algorithms for Computing Percolation Centrality