Fast Local Flow-based Method using Parallel Multi-core CPUs Architecture

Abstract

Large graphs are available in everywhere such as social networks, web link analysis, and computer networks. Traditional methods of clustering are not suitable to tackle the problem of clustering large graphs because the computation is very costly, which is solved by local graph clustering using a given vertex set as input to detect an accurate cluster. SimpleLocal (SL) algorithm detects a best conductance cuts close to seed vertices set. In this paper, a new Parallel SimpleLocal (PSL) system is proposed using multicore CPUs. OpenMP parallel library is utilized to parallelize the first and second stages of 3StageFlow algorithm whereas the SL algorithm is used for enhancing the runtime. The experiments are performed on various applications from different domains, which are image segmentation and community detection. From the experiments, the proposed method improves the runtimes with 75.43% using 4-cores and 81.01% when using 8-cores over the sequential single core.