Parallel algorithms for evaluating centrality indices in real-world networks

David A. Bader, Kamesh Madduri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

121 Scopus citations

Abstract

This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploit properties typically observed in real-world large scale networks, such as the low average distance, high local density, and heavy-tailed power law degree distributions. We test our implementations on real datasets such as the web graph, protein-interaction networks, movie-actor and citation networks, and report impressive parallel performance for evaluation of the computationally intensive centrality metrics (betweenness and closeness centrality) on high-end shared memory symmetric multiprocessor and multithreaded architectures. To our knowledge, these are the first parallel implementations of these widely-used social network analysis metrics. We demonstrate that it is possible to rigorously analyze networks three orders of magnitude larger than instances that can be handled by existing network analysis (SNA) software packages. For instance, we compute the exact betweenness centrality value for each vertex in a large US patent citation network (3 million patents, 16 million citations) in 42 minutes on 16 processors, utilizing 20GB RAM of the IBM p5 570. Current SNA packages on the other hand cannot handle graphs with more than hundred thousand edges.

Original languageEnglish (US)
Title of host publicationICPP 2006
Subtitle of host publicationProceedings of the 2006 International Conference on Parallel Processing
Pages539-547
Number of pages9
DOIs
StatePublished - Dec 1 2006
EventICPP 2006: 2006 International Conference on Parallel Processing - Columbus, OH, United States
Duration: Aug 14 2006Aug 18 2006

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Other

OtherICPP 2006: 2006 International Conference on Parallel Processing
CountryUnited States
CityColumbus, OH
Period8/14/068/18/06

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Engineering(all)

Fingerprint Dive into the research topics of 'Parallel algorithms for evaluating centrality indices in real-world networks'. Together they form a unique fingerprint.

  • Cite this

    Bader, D. A., & Madduri, K. (2006). Parallel algorithms for evaluating centrality indices in real-world networks. In ICPP 2006: Proceedings of the 2006 International Conference on Parallel Processing (pp. 539-547). [1690659] (Proceedings of the International Conference on Parallel Processing). https://doi.org/10.1109/ICPP.2006.57