A space-efficient parallel algorithm for computing betweenness centrality in distributed memory

17th International Conference on High Performance Computing, HiPC 2010

Volumn , Issue , 2010, Pages

  Edmonds, Nick ^a   Hoefler, Torsten ^b   Lumsdaine, Andrew ^a  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BETWEENNESS CENTRALITY; DISTRIBUTED MEMORY; PARALLEL EXECUTIONS; PARALLELIZATIONS; SHORT-PATH; SINGLE PROCESSING UNIT; SOCIAL NETWORK ANALYSIS; SPACE EFFICIENT; STANDARD ALGORITHMS; VERTEX SET;

MEMORY ARCHITECTURE;

EID: 79952790814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HIPC.2010.5713180     Document Type: Conference Paper

References (32)

1. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating Long Messages into the LogP Model. Journal of Par. and Distrib. Computing, 44(1):71-79, 1995. (Pubitemid 127340829)
2. J. Anthonisse. The rush in a directed graph. Technical Report BN9/71, Stichting Mathematisch Centrum, Amsterdam, 1971.
3. D. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In Algorithms and Models for the Web-Graph, volume 4863 of LNCS, pages 124-137. Springer-Verlag, 2007.
4. D. A. Bader and K. Madduri. Parallel algorithms for evaluating centrality indices in real-world networks. In Intl. Conf. on Parallel Processing, pages 539-550, Washington, DC, 2006.
5. R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):87-90, 1958.
6. V. D. Blondel, J.-L. Guillaume, J. M. Hendrickx, and R. M. Jungers. Distance distribution in random graphs and application to network exploration. Physical Review E, 76(066101), 2007.
7. B. Bollobas. Random Graphs. Cambridge University Press, 2001.
8. Boost. Boost C++ Libraries. http://www.boost.org/.
9. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001. (Pubitemid 33398479)
10. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In International Conference on Data Mining, pages 442-446, April 2004.
11. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
12. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra's shortest path algorithm. In Mathematical Foundations of Computer Science, volume 1450 of LNCS, pages 722-731. Springer, 1998.
13. E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
14. N. Edmonds, A. Breuer, D. Gregor, and A. Lumsdaine. Singlesource shortest paths with the Parallel Boost Graph Library. In The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, Piscataway, NJ, November 2006.
15. R. W. Floyd. Algorithm 97: Shortest path. Commun. ACM, 5(6):345, 1962.
16. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, March 1977.
17. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete App. Math., 10:57-77, 1985.
18. D. Gregor, N. Edmonds, A. Breuer, P. Gottschling, B. Barrett, and A. Lumsdaine. The Parallel Boost Graph Library. http://www.osl.iu.edu/research/ pbgl, 2005.
19. R. Hassin and E. Zemel. On shortest paths in graphs with random weights. Math. of Op. Research, 10(4):557-564, November 1985.
20. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley Professional, 1992.
21. J. Jenq and S. Sahni. All pairs shortest paths on a hypercube multiprocessor. In Intl. Conf. on Parallel Processing, pages 713-716, 1987.
22. D. B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24(1):1-13, 1977.
23. V. Kumar and V. Singh. Scalability of parallel algorithms for the all-pairs shortest path problem. In Intl. Conf. on Parallel Processing, pages 124-138, 1991.
24. K. Madduri, D. Bader, J. Berry, and J. Crobak. An experimental study of a parallel shortest path algorithm for solving large-scale graph instances. In Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 2007.
25. K. Madduri, D. Ediger, K. Jiang, D. Bader, and D. Chavarria-Miranda. A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In Multithreaded Arch. and App., May 2009.
26. U. Meyer. Design and analysis of sequential and parallel single-source shortest-paths algorithms. PhD thesis, Universität Saarbrücken, 2002.
27. U. Meyer and P. Sanders. Δ-stepping: A parallelizable shortest path algorithm. J. Algorithms, 49(1):114-152, 2003.
28. G. L. Miller and J. H. Reif. Parallel tree contraction and its application. In Symposium on Foundations of Computer Science, pages 478-489, Washington, DC, USA, 1985. IEEE.
29. G. Sabidussi. The centrality index of a graph. Psychometrika, 31(4):581-603, December 1966.
30. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.
31. S. Warshall. A theorem on boolean matrices. J. ACM, 9(1):11-12, 1962.
32. Q. Yang and S. Lonardi. A parallel algorithm for clustering protein-protein interaction networks. In Computational Systems Bioinformatics Conference - Workshops, pages 174-177, Washington, DC, USA, 2005. IEEE Computer Society.