Efficient Extraction of High Centrality Vertices in Distributed Graphs
- Univ. of Southern California, Los Angeles, CA (United States)
Betweenness centrality (BC) is an important measure for identifying high value or critical vertices in graphs, in variety of domains such as communication networks, road networks, and social graphs. However, calculating betweenness values is prohibitively expensive and, more often, domain experts are interested only in the vertices with the highest centrality values. In this paper, we first propose a partition-centric algorithm (MS-BC) to calculate BC for a large distributed graph that optimizes resource utilization and improves overall performance. Further, we extend the notion of approximate BC by pruning the graph and removing a subset of edges and vertices that contribute the least to the betweenness values of other vertices (MSL-BC), which further improves the runtime performance. We evaluate the proposed algorithms using a mix of real-world and synthetic graphs on an HPC cluster and analyze its strengths and weaknesses. The experimental results show an improvement in performance of upto 12x for large sparse graphs as compared to the state-of-the-art, and at the same time highlights the need for better partitioning methods to enable a balanced workload across partitions for unbalanced graphs such as small-world or power-law graphs.
- Research Organization:
- Univ. of Southern California, Los Angeles, CA (United States)
- Sponsoring Organization:
- USDOE Office of Electricity (OE)
- DOE Contract Number:
- OE0000192
- OSTI ID:
- 1332678
- Report Number(s):
- DOE-USC-00192-89
- Resource Relation:
- Conference: High Performance Extreme Computing Conference, Waltham, MA (United States), 9-11 Sept 2014
- Country of Publication:
- United States
- Language:
- English
Similar Records
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis