Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments

SIAM Journal on Scientific Computing

Volumn 34, Issue 4, 2012, Pages

  Buluç, Aydin ^a   Gilbert, John R ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b University of California   (United States)

Author keywords

Graph algorithms; Graph batch update; Graph contraction; Hypersparsity; Numerical linear algebra; Parallel computing; Sparse matrix assignment; Sparse matrix indexing; Sparse matrix matrix multiplication; Sparse SUMMA; SpGEMM; Subgraph extraction; Two dimensional data decomposition

Indexed keywords

INDEXING (OF INFORMATION); MATRIX ALGEBRA;

GRAPH ALGORITHMS; GRAPH BATCH UPDATES; GRAPH CONTRACTION; HYPERSPARSITY; NUMERICAL LINEAR ALGEBRA; PARALLEL COM- PUTING; SPARSE MATRIX ASSIGNMENTS; SPARSE MATRIX INDEXING; SPARSE MATRIX-MATRIX MULTIPLICATIONS; SPARSE SUMMA; SPGEMM; SUBGRAPH EXTRACTION; TWO-DIMENSIONAL DATA DECOMPOSITIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 84866380590     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/110848244     Document Type: Article

References (38)

1. FRANKLIN, Nersc's Cray XT 4 System, http://www.nersc.gov/users/ computational-systems/franklin/.
2. COMBINATORIAL-BLAS, Combinatorial BLAS Library (MPI reference implementation), http://gauss.cs.ucsb.edu/aydin/CombBLAS/html/index.html, 2012.
3. M. ADAMS AND J. W. DEMMEL, Parallel multigrid solver for 3D unstructured finite element problems, in Supercomputing '99: Proceedings of the 1999 ACM/IEEE Conference on Supercomputing, ACM, New York, IEEE, Washington, DC, 1999, p. 27.
4. G. BALLARD, J. DEMMEL, O. HOLTZ, AND O. SCHWARTZ, Minimizing communication in numerical linear algebra, SIAM. J. Matrix Anal. Appl, 32 (2011), pp. 866-901.
5. W. L. BRIGGS, V. E. HENSON, AND S. F. MCCORMICK, A Multigrid Tutorial, 2nd ed., SIAM, Philadelphia, 2000.
6. A. BULUÇ AND J. R. GILBERT, New ideas in sparse matrix-matrix multiplication, in Graph Algorithms in the Language of Linear Algebra, J. Kepner and J. Gilbert, eds., SIAM, Philadelphia, 2011, pp. 315-337.
7. A. BULUÇ AND J. R. GILBERT, Challenges and advances in parallel sparse matrix-matrix multiplication, in ICPP'08: Proc. of the International Conference on Parallel Processing, IEEE Computer Society, Portland, OR, 2008, pp. 503-510.
8. A. BULUÇ AND J. R. GILBERT, On the representation and multiplication of hypersparse matrices, in IPDPS'08: Proceedings of the 2008 IEEE International Symposium on Parallel and Distributed Processing, IEEE Computer Society, Washington, DC, 2008, pp. 1-11.
9. A. BULUÇ AND J. R. GILBERT, Highly Parallel Sparse Matrix-Matrix Multiplication, Technical report UCSB-CS-2010-10, Computer Science Department, University of California, Santa Barbara, CA, 2010.
10. A. BULUÇ AND J. R. GILBERT, The combinatorial BLAS: Design, implementation, and applications, Internat. J. High Performance Comput. Appl., 25 (2011), pp. 496-509.
11. A. BULUÇ, J. R. GILBERT, AND V. B. SHAH, Implementing sparse matrices for graph algorithms, in Graph Algorithms in the Language of Linear Algebra, J. Kepner and J. Gilbert, eds., SIAM, Philadelphia, 2011, pp. 287-313.
12. A. BULUÇ AND K. MADDURI, Parallel breadth-first search on distributed memory systems, in Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, ACM, New York, 2011, pp. 65:1-65:12.
13. D. CHAKRABARTI, Y. ZHAN, AND C. FALOUTSOS, R-MAT: A recursive model for graph mining, in Proceedings of the 4th SIAM Conference on Data Mining, SIAM, Philadelphia, 2004, pp. 442-446.
14. E. CHAN, M. HEIMLICH, A. PURKAYASTHA, AND R. A. VAN DE GEIJN, Collective communication: Theory, practice, and experience, Concurrency Comput. Practice Experience, 19 (2007), pp. 1749-1783.
15. C. CHEVALIER AND I. SAFRO, Comparison of coarsening schemes for multilevel graph partitioning, in Learning and Intelligent Optimization: Third International Conference, LION 3. Selected Papers, Springer-Verlag, Berlin, Heidelberg, 2009, pp. 191-205.
16. A. CHTCHELKANOVA, J. GUNNELS, G. MORROW, J. OVERFELT, AND R. A. VAN DE GEIJN, Parallel implementation of BLAS: General techniques for Level 3 BLAS, Concurrency Comput. Practice Experience, 9 (1997), pp. 837-857.
17. E. COHEN, Structure prediction and computation of sparse matrix products, J. Combin. Optim., 2 (1998), pp. 307-332.
18. UPC CONSORTIUM, UPC Language Specifications, v1.2, Technical report LBNL-59208, Lawrence Berkeley National Laboratory, Berkeley, CA, 2005.
19. P. D'ALBERTO AND A. NICOLAU, R-Kleene: A high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks, Algorithmica, 47 (2007), pp. 203-213.
20. T. A. DAVIS, Direct Methods for Sparse Linear Systems, SIAM, Philadelphia, 2006.
21. T. A. DAVIS AND Y. HU, The University of Florida sparse matrix collection, ACM Trans. Math. Software, 38 (2011), p. 1.
22. P. ERDÖS AND A. RÉNYI, On random graphs, Publicationes Mathematicae, 6 (1959), pp. 290-297.
23. R. A. VAN DE GEIJN AND J. WATTS, SUMMA: Scalable universal matrix multiplication algorithm, Concurrency Comput. Practice Experience, 9 (1997), pp. 255-274.
24. J. R. GILBERT, C. MOLER, AND R. SCHREIBER, Sparse matrices in MATLAB: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
25. J. R. GILBERT, S. REINHARDT, AND V. B. SHAH, A unified framework for numerical and combinatorial computing, Comput. Sci. Engrg., 10 (2008), pp. 20-25.
26. F. G. GUSTAVSON, Two fast algorithms for sparse matrices: Multiplication and permuted transposition, ACM Trans. Math. Software, 4 (1978), pp. 250-269.
27. B. HENDRICKSON AND R. LELAND, A multilevel algorithm for partitioning graphs, in Supercomputing '95: Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, ACM, New York, IEEE, Washington, DC, 1995, p. 28.
28. 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. Software, 31 (2005), pp. 397-423.
29. H. KAPLAN, M. SHARIR, AND E. VERBIN, Colored intersection searching via sparse rectangular matrix multiplication, in Proceedings of the 22nd Annual Symposium on Computational Geometry, ACM, New York, 2006, pp. 52-60.
30. J. W. H. LIU, The multifrontal method for sparse matrix solution: Theory and practice, SIAM Rev., 34 (1992), pp. 82-109.
31. A. T. OGIELSKI AND W. AIELLO, Sparse matrix computations on parallel processor arrays, SIAM J. Sci. Comput., 14 (1993), pp. 519-530.
32. G. PENN, Efficient transitive closure of sparse matrices over closed semirings, Theoret. Comput. Sci., 354 (2006), pp. 72-81.
33. M. O. RABIN AND V. V. VAZIRANI, Maximum matchings in general graphs through randomization, J. Algorithms, 10 (1989), pp. 557-567.
34. V. B. SHAH, An Interactive System for Combinatorial Scientific Computing with an Emphasis on Programme r Productivity, Ph.D. thesis, University of California, Santa Barbara, CA, 2007.
35. S.-H. TENG, Coarsening, sampling, and smoothing: Elements of the multilevel method, in Parallel Processing, IMA Vol. Math. Appl., 105, Springer-Verlag, Berlin, 1999, pp. 247-276.
36. S. VAN DONGEN, Graph clustering via a discrete uncoupling process, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 121-141.
37. I. YAMAZAKI AND X. LI, On techniques to improve robustness and scalability of a parallel hybrid linear solver, in High Performance Computing for Computational Science, VECPAR, Springer-Verlag, Berlin, Heidelberg, 2010, pp. 421-434.
38. R. YUSTER AND U. ZWICK, Detecting short directed cycles using rectangular matrix multiplication and dynamic programming, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2004, pp. 254-260.