Scalable Static and Dynamic Community Detection Using Grappolo
Graph clustering, popularly known as community detection, is a fundamental kernel for several applications of relevance to the Defense Advanced Research Projects Agency’s (DARPA) Hierarchical Identify Verify Exploit (HIVE) Pro- gram. Clusters or communities represent natural divisions within a network that are densely connected within a cluster and sparsely connected to the rest of the network. The need to compute clustering on large scale data necessitates the development of efficient algorithms that can exploit modern architectures that are fundamentally parallel in nature. How- ever, due to their irregular and inherently sequential nature, many of the current algorithms for community detection are challenging to parallelize. In response to the HIVE Graph Challenge, we present several parallelization heuristics for fast community detection using the Louvain method as the serial template. We implement all the heuristics in a software library called Grappolo. Using the inputs from the HIVE Challenge, we demonstrate superior performance and high quality solutions based on four parallelization heuristics. We use Grappolo on static graphs as the first step towards community detection on streaming graphs.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1434877
- Report Number(s):
- PNNL-SA-128510; 830403000
- Resource Relation:
- Conference: IEEE High Performance Extreme Computing Conference (HPEC 2017), September 12-14, 2017, Waltham, Massachusetts, 1-6
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel Heuristics for Scalable Community Detection
miniVite: A Graph Analytics Benchmarking Tool for Massively Parallel Systems