Hierarchical Parallel Algorithm for Modularity-Based Community Detection Using GPUs
Conference Proceeding Article
This paper describes the design of a hierarchical parallel algorithm for accelerating community detection which involves partitioning a network into communities of densely connected nodes. The algorithm is based on the Louvain method developed at the Université Catholique de Louvain, which uses modularity to measure community quality and has been successfully applied on many different types of networks. The proposed hierarchical parallel algorithm targets three levels of parallelism in the Louvain method and it has been implemented on single-GPU and multi-GPU architectures. Benchmarking results on several large web-based networks and popular social networks show that on top of offering speedups of up to 5x, the single-GPU version is able to find better quality communities. On average, the multi-GPU version provides an additional 2x speedup over the single-GPU version but with a 3% degradation in community quality.
Community detection, parallel algorithm, GPU, social networks
Euro-Par 2013 Parallel Processing: 19th International Conference, Aachen, Germany, August 26-30, 2013. Proceedings
City or Country
CHEONG, Chun Yew; HUYNH, Huynh Phung; LO, David; and GOH, Rick Siow Mong.
Hierarchical Parallel Algorithm for Modularity-Based Community Detection Using GPUs. (2013). Euro-Par 2013 Parallel Processing: 19th International Conference, Aachen, Germany, August 26-30, 2013. Proceedings. 8097, 775-787. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2015
This document is currently not available here.