References & Citations
Computer Science > Distributed, Parallel, and Cluster Computing
Title: GVE-Louvain: Fast Louvain Algorithm for Community Detection in Shared Memory Setting
(Submitted on 8 Dec 2023 (v1), last revised 18 Apr 2024 (this version, v3))
Abstract: Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions is critical in a number of applications, where the size of datasets have reached significant scales. This technical report presents one of the most efficient multicore implementations of the Louvain algorithm, a high quality community detection method. On a server equipped with dual 16-core Intel Xeon Gold 6226R processors, our Louvain, which we term as GVE-Louvain, outperforms Vite, Grappolo, and NetworKit Louvain by 50x, 22x, and 20x respectively - achieving a processing rate of 560M edges/s on a 3.8B edge graph. In addition, GVE-Louvain improves performance at an average rate of 1.6x for every doubling of threads.
Submission history
From: Subhajit Sahu [view email][v1] Fri, 8 Dec 2023 07:26:24 GMT (1877kb,D)
[v2] Mon, 11 Dec 2023 17:33:38 GMT (1882kb,D)
[v3] Thu, 18 Apr 2024 16:17:39 GMT (1332kb,D)
Link back to: arXiv, form interface, contact.