A Distributed Parallel Community Detection Heuristics for Large-scale Real Graphs
1. Symposia on VLSI Technology and Circuits
A Distributed Parallel
Community Detection Heuristics
for Large-scale Real Graphs
Guanglong Chi1,a,b
Ken Wakita2,a,b
Hitoshi Sato3,a,b
1 Department of Human System Science
2 Department of Mathematical and Computing Science
3 Global Scientific Information and Computing Center
a Tokyo Institute of Technology
b JST, CREST
10. 既存の分散手法:PMETISNC-Louvain
(Wickramaarachchi+, HPEC `14)
• 前処理:
PMETISグラフノード分割
(Karypis+, SIAM `98)
• 理由:
– ノード分割により、
計算ノードに跨る
コミュニティ数が少なくなる
– 計算ノード間の通信が
無視できる
• Wickramaarachchi, C., Frincu, M., Small, P. and Prasanna, V. K.: Fast parallel algorithm for
unfolding of communities in large graphs, IEEE HPEC `14, pp.1–6.
• Karypis, G. and Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular
graphs, SIAM Journal on scientific Computing, Vol. 20, No. 1, pp. 359–392 (1998).