Parallel Louvain Community Detection Algorithm Based on Dynamic Thread Assignment on Graphic Processing Unit

Mohammadi, M.; Fazlali, M.; Hosseinzadeh, M.

doi:10.22061/jecei.2021.7771.432

Document Type : Original Research Paper

Authors

¹ Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran

² Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran

³ Mental Health Research Center, Psychosocial Health Research Institute, Iran University of Medical Sciences, Tehran, Iran

https://doi.org/10.22061/jecei.2021.7771.432

Abstract

Background and Objectives: Louvain is a time-consuming community detection algorithm especially in large-scale networks. Using Graphic Processing Unit (GPU) in order to calculate modularity sigma, which is a major processing section in Louvain algorithm, can reduce algorithm execution time and make it practical for large-scale networks.
Methods: The proposed algorithm Dynamic CUDA Louvain Method (DCLM) blocks hardware threads dynamically on cores inside GPU. By considering the properties of GPU, this algorithm allocates the maximal number of processing cores to each Stream Multi-Processor (SM) as number of threads in a block. If the number of nodes in the graph is smaller than all physical cores on GPU, number of threads per block Is equal to the ratio number of graph nodes over the number of SMs.
Results: The implementation results demonstrated that the proposed algorithm is able to decrease the run time by 15% in comparison with the best past method in the large-scale graph.
Conclusion: We have introduced DCLM algorithm based on GPU that accelerates Louvain community detection algorithm. Dynamic allocation of threads to each block has a significant effect on the reduction of algorithm execution time. However, incrementing the number of threads per block alone does not result to acceleration the speed of calculations.

Keywords

20.1001.1.23223952.2022.10.1.7.0

Main Subjects

Paralleling Louvain Community Detection

Open Access

This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit: http://creativecommons.org/licenses/by/4.0/

Publisher’s Note

JECEI Publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Publisher

Shahid Rajaee Teacher Training University

References

[1] M. Guendouz, A. Amine, R. M. Hamou, "Discrete modified fireworks algorithm for community detection in complex networks," Appl. Intell., 46: 373–385, 2017.

[2] D. Sudhakaran, S. Renjith, "Survey of community detection algorithms to identify the best community in real-time networks," Int. J. Sci. Eng. Appl. Sci., (IJSEAS), 2: 529-533, 2016.

[3] S. Fortunato, "Community detection in graphs," Phys. Rep., 486: 75-174, 2010.

[4] M.E.J. Newman, M. Girvan, "Finding and evaluating community structure in networks," Phys. Rev. E, 69: 026113, 2004.

[5] A. Clauset, M.E.J. Newman, C. Moore, "Finding community structure in very large networks," Phys. Rev. E, 70: 066111, 2004.

[6] U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, D. Wagner, "On modularity clustering," IEEE Trans. Knowl. Data Eng., 20: 172-188, 2008.

[7] M. Faysal, S. Arifuzzaman, "Distributed community detection in large networks using an information-theoretic approach," in Proc. 2019 IEEE International Conference on Big Data (Big Data): 4773-4782, 2019.

[8] Q. Ni, J. Guo, W. Wu, C. Huang, "Continuous inuence-based community partition for social networks," arXiv:2002.08554v1 [cs.SI] 20 Feb 2020, 2020.

[9] V.D. Blondel, J.L. Guillaume, R. Lambiotte, E. Lefebvre, "Fast unfolding of communities in large networks," J. Stat. Mech., 10: P10008, 2008.

[10] E. Moradi, M. Fazlali, H. Tabatabaee Malazi, "Fast parallel community detection algorithm based on modularity," in proc. 2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS), IEEE, 2015.

[11] C.L. Staudt, H. Meyerhenke, "Engineering parallel algorithms for community detection in massive networks," in proc. 42nd International Conference on Parallel Processing, 2013.

[12] C.Y. Cheong, H.P. Huynh, D. Lo, R.S.M. Goh, "Hierarchical parallel algorithm for modularity-based community detection using GPUs," in proc. 19th International Conference on Parallel Processing, Euro-Par’13: 775–787, 2013.

[13] H. Lu, M. Halappanavar, A. Kalyanaraman, "Parallel heuristics for scalable community detection," Parallel Comput., 47: 9–37, 2015.

[14] M. Fazlali, E. Moradi, H. Tabatabaee Malazi, "Adaptive parallel Louvain community detection on a multicore platform," Microprocess. Microsyst., 54: 26–34, 2017.

[15] J. Zeng, H. Yu, "A scalable distributed louvain algorithm for large-scale graph community detection," in proc. 2018 IEEE International Conference on Cluster Computing (CLUSTER), 2018.

[16] R. Forster, "Louvain community detection with parallel heuristics on GPUs," presented at the IEEE 20th Jubilee International Conference on Intelligent Engineering Systems (INES), Budapest,
Hungary, 2016.

[17] L. Zhang, M. Wahib, H. Zhang, S. Matsuoka, "A study of single and multi-device ynchronization methods in nvidia GPUs," in proc. IEEE International Parallel & Distributed Processing Symposium 2020.

[18] Y. Wang, M. Guo, Y. Zhao, J. Jiang, "GPUs‑RRTMG_LW: high-efficient and scalable computing for a longwave radiative transfer model on multiple GPUs," J. Supercomput. 77: 4698–4717, 2020.

[19] M.E.J. Newman, "Modularity and community structure in networks," in proc. Natl. Acad. Sci, 103: 8577–8582, 2006.

[20] D. LaSalle, G. Karypis, "Multi-threaded modularity based graph clustering using the multilevel paradigm," J. Parallel Distrib. Comput., 76: 66-80, 2015.

[21] Y. Guo, Z. Huang, Y. Kong, Q. Wang, "Modularity and mutual information in networks: two sides of the same coin," arXiv preprint arXiv:2103.02542, 2021.

[22] C.L. Staudt, H. Meyerhenke, "Engineering parallel algorithms for community detection in massive networks," IEEE Trans. Parallel Distrib. Syst., 27: 171–184, 2016.

[23] U.N. Raghavan, R. Albert, S. Kumara, "Near linear time algorithm to detect community structures in large-scale networks," Phys. Rev. E, 76: 036106, 2007.

[24] G.S. Carnivali, A.B. Vieira, A. Ziviani, P.A.A. Esquef, "CoVeC: Coarse-Grained vertex clustering for efficient community detection in sparse complex networks," Inf. Sci., 522: 180-192, 2020.

[25] X. Que, F. Checconi, F. Petrini, J. Gunnels, "Scalable community detection with louvain algorithm," in proc. 2015 IEEE 29th International Parallel and Distributed Processing Symposium, 2015.

[26] J. Zeng, H. Yu, "Effectively unified optimization for large-scale graph community detection," in proc. 2019 IEEE International Conference on Big Data (Big Data): 475-482, 2019.

[27] W. Fang, X. Wang, L. Liu, Z. Wu, S. Tang, Z. Zheng, "Community detection through vector-label propagation algorithms," arXiv preprint arXiv:2011.08342, 2020.

[28] R.P. Sarmento, "Density-based community detection/optimization" arXiv preprint arXiv: 1904.12593, 2019.

[29] J. Huang, T. Zhang, W. Yu, J. Zhu, E. Cai, "Community detection based on modularized deep nonnegative matrix factorization," Int. J. Pattern Recognit Artif Intell., 35(2): 21590061-215900617, 2020.

[30] S. Souravlas, A. Sifaleras, S. Katsavounis, "Hybrid CPU-GPU community detection in weighted networks," IEEE Access, 8: 57527 – 57551, 2020.

[31] J. Shao, Z. Han, Q. Yang, T. Zhou, "Community detection based on distance dynamics," in proc. 21th ACM SIGKDD international conference on knowledge discovery and data mining. New York: ACM: 1075-1084, 2015.

[32] J. Zhu, X. Ren, P. Ma, K. Gao, "Community detection on complex networks based on a new centrality indicator and a new modularity function," arXiv preprint arXiv:2003.13609, 2020.

[33] I. Gutiérrez, D. Gómez, J. Castro, R. Espínola, "A new community detection algorithm based on fuzzy measures," in Proc. International Conference on Intelligent and Fuzzy Systems: 133-140, 2019.

[34] P. Miasnikof, A.Y. Shestopaloff, A.J. Bonner, "A density-based statistical analysis of graph clustering algorithm performance," J. Complex Networks, 8(3): 1-33, 2020.

[35] D. Jin, B. Zhang, Y. Song, D. He, Z. Feng, S. Chen, W. Li, K. Musial, "ModMRF: A modularity-based Markov Random Field method for community detection," Neurocomputing, 405: 218-228, 2020.

[36] G. Konstantinos, M. Christos, P. Georgios, "A distributed hybrid community detection methodology for social networks," Algorithms, 12(8): 175, 2019.

[37] J.O. Palacio-Niño, F. Berzal "On the use of local structural properties for improving the efficiency of hierarchical community detection methods," arXiv preprint arXiv:2009.06798, 2020.

[38] A. Mahabadi, M. Hosseini, "SLPA-based parallel overlapping community detection approach in large complex social networks," Multimed. Tool. Appl., 80: 6567–6598, 2021.

[39] M.d. Naim, F. Manne, M. Halappanavar, A. Tumeo, "Community detection on the GPU," in proc. 2017 IEEE International Parallel and Distributed Processing Symposium, 2017.

[40] M. Mohammadi, M. Fazlali, M. Hosseinzadeh, "Accelerating Louvain community detection algorithm on graphic processing unit," J. Supercomput., 77: 6056–6077, 2021.

[41] M.E.J. Newman, "Fast algorithm for detecting community structure in networks," Phys. Rev. E, 69: 066133, 2004.

LETTERS TO EDITOR

Journal of Electrical and Computer Engineering Innovations (JECEI) welcomes letters to the editor for the post-publication discussions and corrections which allows debate post publication on its site, through the Letters to Editor. Letters pertaining to manuscript published in JECEI should be sent to the editorial office of JECEI within three months of either online publication or before printed publication, except for critiques of original research. Following points are to be considering before sending the letters (comments) to the editor.

[1] Letters that include statements of statistics, facts, research, or theories should include appropriate references, although more than three are discouraged.

[2] Letters that are personal attacks on an author rather than thoughtful criticism of the author’s ideas will not be considered for publication.

[3] Letters can be no more than 300 words in length.

[4] Letter writers should include a statement at the beginning of the letter stating that it is being submitted either for publication or not.

[5] Anonymous letters will not be considered.

[6] Letter writers must include their city and state of residence or work.

[7] Letters will be edited for clarity and length.

Name *

Email Address *

Affiliation *

Comments *

Security Code *

Journal of Electrical and Computer Engineering Innovations (JECEI)

Parallel Louvain Community Detection Algorithm Based on Dynamic Thread Assignment on Graphic Processing Unit

References

References

Send comment about this article

Volume 10, Issue 1
January 2022
Pages 75-88

Parallel Louvain Community Detection Algorithm Based on Dynamic Thread Assignment on Graphic Processing Unit

References

References

Send comment about this article

Volume 10, Issue 1January 2022Pages 75-88

Volume 10, Issue 1
January 2022
Pages 75-88