GraphCT: Multithreaded algorithms for massive graph analysis

IEEE Transactions on Parallel and Distributed Systems

Volumn 24, Issue 11, 2013, Pages 2220-2229

  Ediger, David ^a   Jiang, Karl ^a   Riedy, E Jason ^a   Bader, David A ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Cray XMT; Graph algorithms; high performance computing; multithreaded architectures; network analysis

Indexed keywords

BETWEENNESS CENTRALITY; CONNECTED COMPONENT; CRAY XMT; GRAPH ALGORITHMS; HIGH-PERFORMANCE COMPUTING; MACHINE ARCHITECTURES; MULTI-THREADED ALGORITHMS; MULTITHREADED ARCHITECTURE;

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; QUERY PROCESSING; SEMANTICS;

GRAPH THEORY;

EID: 84885155744     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2012.323     Document Type: Article

References (36)

1. Facebook, "User Statistics," http://newsroom. fb. com/content/default. aspx?NewsAreaId=22, Mar. 2012.
2. C. L. Borgman, J. C. Wallis, M. S. Mayernik, and A. Pepe, "Drowning in Data: Digital Library Architecture to Support Scientific Use of Embedded Sensor Networks," Proc. Seventh ACM/IEEE-CS Joint Conf. Digital Libraries, pp. 269-277, 2007. (Pubitemid 350157991)
3. F. Liljeros, C. Edling, L. Amaral, H. Stanley, and Y. Aberg, "The Web of Human Sexual Contacts," Nature, vol. 411, pp. 907-908, 2001.
4. H. Jeong, S. Mason, A.-L. Barabási, and Z. Oltvai, "Lethality and Centrality in Protein Networks," Nature, vol. 411, pp. 41-42, 2001. (Pubitemid 32428180)
5. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, "Breakdown of the Internet under Intentional Attack," Physical Rev. Letters, vol. 86, no. 16, pp. 3682-3685, 2001. (Pubitemid 32416204)
6. R. Kouzes, G. Anderson, S. Elbert, I. Gorton, and D. Gracio, "The Changing Paradigm of Data-Intensive Computing," Computer, vol. 42, no. 1, pp. 26-34, Jan. 2009.
7. V. Batagelj and A. Mrvar, "Pajek-Program for Large Network Analysis," Connections, vol. 21, pp. 47-57, 1998.
8. G. Csardi and T. Nepusz, "The Igraph Software Package for Complex Network Research," InterJ., vol. Complex Systems, p. 1695, http://igraph. sf. net, 2006.
9. D. Auber, "Tulip," Proc. Ninth Symp. Graph Drawing, P. Mutzel, M. Jü nger, and S. Leipert, eds., pp. 335-337, 2001.
10. Analytic Technologies, "UCINET 6 Social Network Analysis Software," http://www.analytictech. com/ucinet. htm, 2013.
11. "GraphCT," ver. 0. 8. 0, http://www.cc. gatech. edu/bader, Sept. 2012.
12. D. Watts and S. Strogatz, "Collective Dynamics of Small World Networks," Nature, vol. 393, pp. 440-442, 1998.
13. J. Berry, B. Hendrickson, S. Kahan, and P. Konecny, "Software and Algorithms for Graph Queries on Multithreaded Architectures," Proc. Workshop Multithreaded Architectures and Applications, Mar. 2007.
14. 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 Data Sets," Proc. Workshop Multithreaded Architectures and Applications (MTAAP '09), May 2009.
15. K. Jiang, D. Ediger, and D. A. Bader, "Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation," Proc. 38th Int'l Conf. Parallel Processing (ICPP '09), Sept. 2009.
16. D. Ediger, K. Jiang, J. Riedy, and D. A. Bader, "Massive Streaming Data Analytics: A Case Study with Clustering Coefficients," Proc. Workshop Multithreaded Architectures and Applications (MTAAP), Apr. 2010.
17. D. Ediger, K. Jiang, J. Riedy, D. A. Bader, C. Corley, R. Farber, and W. N. Reynolds, "Massive Social Network Analysis: Mining Twitter for Social Good," Proc. Int'l Conf. Parallel Processing, pp. 583-593, 2010.
18. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: A System for Large-Scale Graph Processing," Proc. Int'l Conf. Management of Data, pp. 135-146, http://doi. acm. org/10. 1145/1807167. 1807184, 2010.
19. D. Gregor and A. Lumsdaine, "Lifting Sequential Graph Algorithms for Distributed-Memory Parallel Computation," ACM SIGPLAN Notices, vol. 40, no. 10, pp. 423-437, 2005.
20. A. Lugowski, D. Alber, A. Buluc, J. R. Gilbert, S. Reinhardt, Y. Teng, and A. Waranis, "A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis," Proc. 12th SIAM Int'l Conf. Data Mining (SDM '12), pp. 930-941, http://siam. omnibooksonline. com/2012datamining/data/papers/158. pdf/, Apr. 2012.
21. U. Kang, B. Meeder, and C. Faloutsos, "Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation," Proc. 15th Pacific-Asia Conf. Advances in Knowledge Discovery and Data Mining, pp. 13-25, http://dl. acm. org/citation. cfm?id=2022850. 2022852, 2011.
22. A. A. Hagberg, D. A. Schult, and P. J. Swart, "Exploring Network Structure, Dynamics, and Function Using NetworkX," Proc. Seventh Python in Science Conf. (SciPy '08), pp. 11-15, Aug. 2008.
23. D. Bader and K. Madduri, "SNAP, Small-World Network Analysis and Partitioning: An Open-Source Parallel Graph Framework for the Exploration of Large-Scale Networks," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '08), Apr. 2008.
24. A. Buluc? and K. Madduri, "Parallel Breadth-First Search on Distributed Memory Systems," Proc. Int'l Conf. High Performance Computing, Networking, Storage and Analysis, pp. 65:1-65:12, http://doi. acm. org/10. 1145/2063384. 2063471, 2011.
25. E. Prud'hommeaux and A. Seaborne, "SPARQL Query Language for RDF," technical report, W3C, http://www.w3. org/TR/rdf-sparql-query/, 2006.
26. P. Boldi and S. Vigna, "The Webgraph Framework I: Compression Techniques," Proc. 13th Int'l Conf. World Wide Web, pp. 595-602, http://doi. acm. org/10. 1145/988672. 988752, 2004. (Pubitemid 40752793)
27. K. Lang, "Finding Good Nearly Balanced Cuts in Power Law Graphs," technical report, Yahoo! Research, 2004.
28. J. Feo, D. Harper, S. Kahan, and P. Konecny, "Eldorado," Proc. Second Conf. Computing Frontiers, pp. 28-34, http://doi. acm. org/10. 1145/1062261. 1062268, 2005. (Pubitemid 43325337)
29. S. Even, Graph Algorithms. W. H. Freeman & Co., 1979.
30. D. Bader, S. Kintali, K. Madduri, and M. Mihail, "Approximating Betweenness Centrality," Proc. Fifth Workshop Algorithms and Models for the Web-Graph (WAW '07), pp. 134-137, Dec. 2007.
31. M. E. J. Newman, "Modularity and Community Structure in Networks," Proc. Nat'l Academy of Sciences, vol. 103, no. 23, pp. 8577-8582, 2006. (Pubitemid 43878062)
32. B. Bollobas, Modern Graph Theory. Springer, 1998.
33. L. Freeman, "A Set of Measures of Centrality Based on Betweenness," Sociometry, vol. 40, no. 1, pp. 35-41, 1977.
34. Y. Shiloach and U. Vishkin, "An Olog n Parallel Connectivity Algorithm," J. Algorithms, vol. 3, no. 1, pp. 57-67, 1982.
35. S. J. Plimpton and K. D. Devine, "MapReduce in MPI for Large-Scale Graph Algorithms," Parallel Computing, vol. 37, no. 9, pp. 610-632, http://dx. doi. org/10. 1016/j. parco. 2011. 02. 004, Sept. 2011.
36. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.