Scalable communication protocols for dynamic sparse data exchange
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Approximating betweenness centrality
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Accelerating large graph algorithms on the GPU using CUDA
HiPC'07 Proceedings of the 14th international conference on High performance computing
Petascale computing for large-scale graph problems
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Survey of graph database performance on the HPC scalable graph analysis benchmark
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
A discussion on the design of graph database benchmarks
TPCTC'10 Proceedings of the Second TPC technology conference on Performance evaluation, measurement and characterization of complex systems
Analysis and performance results of computing betweenness centrality on IBM Cyclops64
The Journal of Supercomputing
Performance analysis of an algorithm for computation of betweenness centrality
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
The Combinatorial BLAS: design, implementation, and applications
International Journal of High Performance Computing Applications
Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion
Green-Marl: a DSL for easy and efficient graph analysis
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
QUBE: a quick algorithm for updating betweenness centrality
Proceedings of the 21st international conference on World Wide Web
k-Centralities: local approximations of global measures based on shortest paths
Proceedings of the 21st international conference companion on World Wide Web
Elixir: a system for synthesizing concurrent graph programs
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
A software architecture for Twitter collection, search and geolocation services
Knowledge-Based Systems
Betweenness centrality: algorithms and implementations
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Fast Exact Computation of betweenness Centrality in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
A GPU-based method for computing eigenvector centrality of gene-expression networks
AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
Simplifying Scalable Graph Processing with a Domain-Specific Language
Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization
Hi-index | 0.00 |
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.