A flexible open-source toolbox for scalable complex graph analysis

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 930-941

  Lugowski, Adam ^a   Alber, David ^b   Buluç, Aydin ^c   Gilbert, John R ^a   Reinhardt, Steve ^d   Teng, Yun ^a   Waranis, Andrew ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT   (United States)

^c LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^d CRAY INC   (United States)

Author keywords

Domain experts; Massive graph analysis; Open source software; Scalability; Sparse matrices

Indexed keywords

ABSTRACTING; BENCHMARKING; DATA MINING; HIGH LEVEL LANGUAGES; MATRIX ALGEBRA; OPEN SYSTEMS; SCALABILITY; SEMANTICS; SUPERCOMPUTERS;

COMPETITIVE PERFORMANCE; DISTRIBUTED MEMORY; DOMAIN EXPERTS; MASSIVE GRAPH; OPEN SOURCE TOOLBOXES; ORDERS OF MAGNITUDE; SCALABILITY AND PERFORMANCE; SPARSE MATRICES;

OPEN SOURCE SOFTWARE;

EID: 84867528868     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.80     Document Type: Conference Paper

References (37)

1. D. Bader, J. Gilbert, J. Kepner, D. Koester, E. Loh, K. Madduri, B. Mann, and T. Meuse. HPCS Scalable Synthetic Compact Applications #2. http://graphanalysis.org/benchmark.
2. D.A. Bader, J. Berry, A. Amos-Binks, D. Chavarría- Miranda, C. Hastings, K. Madduri, and S.C. Poulos. STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) extensible representation. Georgia Institute of Technology, Tech. Rep, 2009.
3. D.A. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating Betweenness Centrality. In A. Bonato and F. Chung, editors, Algorithms and Models for the Web-Graph, volume 4863 of Lecture Notes in Computer Science, pages 124-137. Springer Berlin/Heidelberg, 2007.
4. J.W. Berry, B. Hendrickson, S. Kahan, and P. Konecny. Software and Algorithms for Graph Queries on Multithreaded Architectures. In Proc. Workshop on Mul- Tithreaded Architectures and Applications. IEEE Press, 2007.
5. D. Bickson. Gaussian Belief Propagation: Theory and Application. CoRR, abs/0811.2518, 2008.
6. U. Brandes. A Faster Algorithm for Betweenness Centrality. J. Math. Sociol., 25(2):163-177, 2001.
7. S. Brohée and J. van Helden. Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics, 7:488, 2006.
8. A. Buluç and J.R. Gilbert. The Combinatorial BLAS: Design, implementation, and applications. The Inter- national Journal of High Performance Computing Ap- plications, 25(4):496-509, 2011.
9. A. Buluç and K. Madduri. Parallel breadth-first search on distributed memory systems. In Proc. Supercomput- ing, 2011.
10. T.A. Davis and Y. Hu. The University of Florida Sparse Matrix Collection. ACM Transactions on Math- ematical Software, to appear, 2011.
11. J. Dean and S. Ghemawat. MapReduce: simplified data processing on large clusters. In Proc. 6th Sympo- sium on Operating System Design and Implementation, pages 137-149, Berkeley, CA, USA, 2004. USENIX Association.
12. B. Dorow. A Graph Model for Words and their Meanings. PhD thesis, Universität Stuttgart, 2006.
13. A.J. Enright, S. Van Dongen, and C.A. Ouzounis. An eficient algorithm for large-scale detection of protein families. Nucl. Acids Res., 30(7):1575-1584, 2002.
14. L.C. Freeman. A Set of Measures of Centrality Based on Betweenness. Sociometry, 40(1):35-41, 1977.
15. A.V. Goldberg and R.F. Werneck. Computing Pointto- Point Shortest Paths from External Memory. In Proc. 7th Workshop on Algorithm Engineering and Experiments (ALENEX05), pages 26-40, 2005.
16. Graph500. http://www.graph500.org.
17. D. Gregor and A. Lumsdaine. The Parallel BGL: A Generic Library for Distributed Graph Computations. In Proc. Workshop on Parallel/High-Performance Object-Oriented Scientific Computing (POOSC'05), 2005.
18. M. A. Heroux, R. A. Bartlett, V. E. Howle, R. J. Hoekstra, J. J. Hu, T. G. Kolda, R. B. Lehoucq, K. R. Long, R. P. Pawlowski, E. T. Phipps, A. G. Salinger, H. K. Thornquist, R. S. Tuminaro, J. M. Willenbring, A. Williams, and K. S. Stanley. An Overview of the Trilinos Project. ACM Trans. Math. Softw., 31:397-423, September 2005.
19. U. Kang, C.E. Tsourakakis, and C. Faloutsos. PEGASUS: A Peta-Scale Graph Mining System-Implementation and Observations. In Data Mining, 2009. ICDM'09. Ninth IEEE International Conference on, pages 229-238. IEEE, 2009.
20. G. Karypis, K. Schloegel, and V. Kumar. ParMETIS: Parallel Graph Partitioning and Sparse Matrix Ordering Library. Technical report, Dept. of Computer Science, University of Minnesota, 1997.
21. P. Konecny. Introducing the Cray XMT. Cray User Group meeting (CUG), 2007.
22. L.Q. Lee, A. Lumsdaine, and J.G. Siek. The Boost Graph Library: User Guide and Reference Manual, 2002. www.osl.iu.edu/publications/Year/2002. complete.php.
23. R.B. Lehoucq, D.C. Sorensen, and C. Yang. ARPACK Users' Guide: Solution of Large Scale Eigenvalue Prob- lems with Implicitly Restarted Arnoldi Methods. SIAM, 1998.
24. J. Leskovec, D. Chakrabarti, J. Kleinberg, and C. Faloutsos. Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. In PKDD, pages 133-145. Springer, 2005.
25. X.S. Li, J.W. Demmel, J.R. Gilbert, L. Grigori, and M. Shao. SuperLU Users' Guide, 2010.
26. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J.M. Hellerstein. GraphLab: A New Parallel Framework for Machine Learning. In Confer- ence on Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, July 2010.
27. G. Malewicz, M.H. Austern, A.J.C. Bik, J.C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: A System for Large-Scale Graph Processing. In Proceedings of the 2010 International Conference on Management of Data, SIGMOD '10, pages 135-146, New York, NY, USA, 2010. ACM.
28. K.J. Maschho and D.C. Sorensen. A portable implementation of ARPACK for distributed memory parallel architectures. In Proceedings of the Copper Moun- Tain Conference on Iterative Methods, pages 9-13, April 1996.
29. J. McPherson, K.-L. Ma, and M. Ogawa. Discovering Parametric Clusters in Social Small-World Graphs. In Proceedings of the 2005 ACM symposium on Applied computing, SAC '05, pages 1231-1238, New York, NY, USA, 2005. ACM.
30. H. Meuer, E. Strohmaier, J.J. Dongarra, and H.D. Simon. Top500 supercomputer sites. In Proc. SC2001, pages 10-16, 2001. http://www.top500.org.
31. M. Najork and J. L. Wiener. Breadth-First Search Crawling Yields High-Quality Pages. In Proceedings of the 10th International Conference on World Wide Web, WWW '01, pages 114-118, New York, NY, USA, 2001. ACM.
32. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66, Stanford InfoLab, November 1999. Previous number = SIDL-WP-1999- 0120.
33. A. Petróczi, Tamás Nepusz, and Fülöp Bazsó. Measuring tie-strength in virtual social networks. CONNEC- TIONS-the oficial journal of the International Net- work for Social Network Analysis, 27(2):49-57, 2006.
34. J. Siek, A. Lumsdaine, and L.Q. Lee. Boost Graph Library, 2001. http://www.boost.org/libs/graph/doc/index.html.
35. Titan Informatics Toolkit. http://titan.sandia.gov.
36. S. van Dongen. Graph Clustering via a Discrete Uncoupling Process. SIAM J. Matrix Anal. Appl, 30(1):121-141, 2008.
37. J.S. Yedidia, W.T. Freeman, and Y. Weiss. Understanding Belief Propagation and its Generalizations. Exploring artificial intelligence in the new millennium, 8:236-239, 2003.