Fast Community Detection in Graphs with Infomap Method using Accelerated Sparse Accumulation
Fast Community Detection in Graphs with Infomap Method using Accelerated Sparse Accumulation
复制标题
DOI:
10.1109/ipdpsw59300.2023.00103
复制
发表时间:
2023-05
期刊:
影响因子:
--
通讯作者:
M. A. M. Faysal-M.-A.-M.-Faysal-65776774;Maximilian H. Bremer;S. Arifuzzaman;Doru-Thom Popovici;J. Shalf;Cy Chan
中科院分区:
文献类型:
--
作者:
M. A. M. Faysal-M.-A.-M.-Faysal-65776774;Maximilian H. Bremer;S. Arifuzzaman;Doru-Thom Popovici;J. Shalf;Cy Chan
Information-theoretic community discovery method (popularly known as Infomap) is known for delivering better quality results in the Lancichinetti–Fortunat–Radicchi (LFR) benchmark compared to modularity-based algorithms. Parallel algorithms have been developed for Infomap due to the computational challenge of analyzing massive graphs resulting from the tremendous growth of information in bio-sciences, social sciences, business, and other domains. The state-of-the-art techniques on information-theoretic community discovery use hash tables for storing vertex neighborhood flow information, which can be computationally expensive due to collision handling operations and CPU branch mispredictions. The Accelerated Sparse Accumulation (ASA) hardware accelerator for hash accumulation has been developed recently for sparse matrix-matrix multiplication (SpGEMM). We generalize the interface of the ASA accelerator and demonstrate that for state-of-the-art parallel Infomap, the accelerator for hash accumulation with fast on-chip memory can overcome the performance bottlenecks of software hash tables and can achieve a speedup of $5.56\times$ while reducing the number of branch mispredictions by 59%, the CPI rate by 21%, and the total number of instructions by 24%.