A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Madduri, Kamesh ^a   Ediger, David ^b   Jiang, Karl ^b   Bader, David A ^b   Chavarría Miranda, Daniel ^c  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b Georgia Institute of Technology   (United States)

^c PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTOR-NETWORK; BETWEENNESS CENTRALITY; COMPLEX NETWORKS; HIGH-PERFORMANCE COMPUTING; LOCK-FREE; MASSIVE DATA SETS; MULTI-THREADED IMPLEMENTATION; MULTITHREADED; OPTIMIZED IMPLEMENTATION; PARALLEL IMPLEMENTATIONS; PERFORMANCE IMPROVEMENTS; POWER GRIDS; REAL-WORLD DATASETS; SMALL WORLD NETWORKS; SOCIAL NETWORKS; SPATIAL LOCALITY;

BEHAVIORAL RESEARCH; BENCHMARKING; COMPUTATION THEORY; DISTRIBUTED PARAMETER NETWORKS; GRAPH THEORY; MULTITASKING; POWER GENERATION;

PARALLEL ALGORITHMS;

EID: 70449792770     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161100     Document Type: Conference Paper

References (17)

1. D. Bader, J. Gilbert, J. Kepner, and K. Madduri, "HPC graph analysis benchmark," 2006, http://www.graphanalysis.org/benchmark.
2. D. Bader, S. Kintali, K. Madduri, and M. Mihail, "Approximating betweenness centrality," in Proc. 5th Workshop on Algorithms and Models for the Web-Graph (WAW2007), ser. Lecture Notes in Computer Science, vol. 4863. San Diego, CA: Springer-Verlag, December 2007, pp. 134-137.
3. D. Bader and K. Madduri, "Parallel algorithms for evaluating centrality indices in real-world networks," in Proc. 35th Int'l Conf. on Parallel Processing (ICPP). Columbus, OH: IEEE Computer Society, Aug. 2006.
4. D. Bader, K. Madduri, J. Gilbert, J. Kepner, T. Meuse, and A. Krishnamurthy, "Scalable synthetic compact applications for benchmarking high productivity computing systems," CT-Watch Quarterly, vol. 2, no. 4B, pp. 41-51, 2006.
5. U. Brandes, "A faster algorithm for betweenness centrality," J. Mathematical Sociology, vol. 25, no. 2, pp. 163-177, 2001.
6. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-MAT: A recursive model for graph mining," in Proc. 4th SIAM Intl. Conf. on Data Mining (SDM). Orlando, FL: SIAM, Apr. 2004.
7. T. Coffman, S. Greenblatt, and S. Marcus, "Graph-based technologies for intelligence analysis," Communications of the ACM, vol. 47, no. 3, pp. 45-47, 2004.
8. DARPA Information Processing Technology Office, "High productivity computing systems project," 2004, http://www.highproductivity.org.
9. R. Guimerà, S. Mossa, A. Turtschi, and L. Amaral, "The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles," Proceedings of the National Academy of Sciences USA, vol. 102, no. 22, pp. 7794-7799, 2005.
10. IMDb.com, Inc., "The internet movie database," 2008, http://www.imdb.com/interfaces.
11. H. Jeong, S. Mason, A.-L. Barabási, and Z. Oltvai, "Lethality and centrality in protein networks," Nature, vol. 411, pp. 41-42, 2001.
12. P. Konecny, "Introducing the Cray XMT," in Proc. Cray User Group meeting (CUG 2007). Seattle, WA: CUG Proceedings, May 2007.
13. K. Lang, "Finding good nearly balanced cuts in power law graphs," Yahoo! Research, Tech. Rep., 2004.
14. F. Liljeros, C. Edling, L. Amaral, H. Stanley, and Y. A berg, "The web of human sexual contacts," Nature, vol. 411, pp. 907-908, 2001.
15. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry, "Challenges in parallel graph processing," Parallel Processing Letters, vol. 17, no. 1, pp. 5-20, 2007.
16. K. Madduri, D. Bader, J. Berry, J. Crobak, and B. Hendrickson, "Multithreaded algorithms for processing massive graphs," in Petascale Computing: Algorithms and Applications, D. Bader, Ed. Chapman and Hall/CRC, 2007, ch. 12, pp. 237-262.
17. K. Madduri, D. Ediger, K. Jiang, D. Bader, and D. Chavarría- Miranda, "A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets," Lawrence Berkeley National Laboratory, Tech. Rep., 2009.