Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4956708 | Microprocessors and Microsystems | 2017 | 30 Pages |
Abstract
Community detection is a demanded technique in analyzing complex and massive graph-based networks. The quality of the detected communities in an acceptable time is an important aspect of an algorithm, which aims at passing through an ultra large scale graph, for instance a social network graph. In this paper, an efficient method is proposed to tackle Louvain community detection problem on multicore systems in the line of thread-level parallelization. The main contribution of this article is to present an adaptive parallel thread assignment for the calculation of adding qualified neighbor nodes to the community. This leads to obtain a better load balancing method for the execution of threads. The proposed method is evaluated on an AMD system with 64 cores, and can reduce the execution time by 50% in comparison with the previous fastest parallel algorithms. Moreover, it was observed in the course of the experiments that our method could find comparably qualified communities.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Mahmood Fazlali, Ehsan Moradi, Hadi Tabatabaee Malazi,