An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality

• Published in: Proceedings (Symposium on Computer Architecture and High Performance Computing) pp. 100 - 109
• Main Authors: van der Grinten, Alexander, Custers, Geert, Thanh, Duy Le, Meyerhenke, Henning
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2022
• Subjects: algebraic graph algorithm; Codes; Computer architecture; Graphics processing units; Harmonic analysis; harmonic centrality; Heuristic algorithms; High performance computing; MPI parallelism; network analysis; Parallel processing; top-k ranking
• ISSN: 2643-3001
• DOI: 10.1109/SBAC-PAD55451.2022.00021

Analyzing large graphs in parallel has received considerable attention recently due to ever increasing data set sizes. Centrality measures indicate the importance of vertices (or edges) and belong to the most widely used analytic kernels. Harmonic centrality is a popular vertex centrality measure with many desirable properties. Since most of the applications of vertex centrality rely only on the ranking of vertices and not on their exact centrality scores, previous research has considered various algorithms that can quickly determine a ranking of the top-k vertices with highest harmonic centrality. Such algorithms are available for many types of real-world graphs, including dynamic graphs. Yet, no attempts have been made to efficiently parallelize these top-k algorithms (besides naive implementations based on a global lock). In this paper, we propose an MPI-distributed algorithm for (dynamic) top-k harmonic centrality. Our algorithm exploits an algebraic BFS technique and batching to parallelize the approximation of centrality scores of multiple vertices. Likewise, we use algebraic techniques to compute various bounds and heuristics that are necessary to obtain a fast top-k algorithm. Experiments demonstrate that our MPI-parallel algorithm outperforms existing implementations. Consequently, our new approach allows the computation of top-k harmonic centrality on graphs that are substantially larger.