Challenges and advances in parallel sparse matrix-matrix multiplication

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2008, Pages 503-510

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

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC OPERATIONS; COMMUNICATION COSTS; D ALGORITHMS; DENSE MATRIXES; ID ALGORITHMS; MATRIX MULTIPLICATIONS; PARALLEL SPARSE MATRIXES; SPARSE ALGORITHMS;

ALGORITHMS; ELECTRIC POWER UTILIZATION; ONLINE SEARCHING;

PARALLEL ALGORITHMS;

EID: 55849139091     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2008.45     Document Type: Conference Paper

References (21)

1. C. Bell, D. Bonachea, R. Nishtala, and K. A. Yelick. Optimizing bandwidth limited problems using one-sided communication and overlap. In IPDPS, Rhodes Island, Greece, 2006. IEEE Computer Society.
2. W. L. Briggs, V. E. Henson, and S. F. McCormick. A multi-grid tutorial: second edition. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
3. M. R. Brown and R. E. Tarjan. A fast merging algorithm. Journal of the ACM, 26(2):211-226, 1979.
4. A. Buluç and J. R. Gilbert. On the Representation and Multiplication of Hypersparse Matrices. In IPDPS, Miami, FL, USA, 2008. IEEE Computer Society.
5. L. E. Cannon. A cellular computer to implement the kalman filter algorithm. PhD thesis, Montana State University, 1969.
6. 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: Practice and Experience, 9(9):837-857, 1997.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, chapter 3, page 55. The MIT Press, second edition, 2001.
8. 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(2):203-213, 2007.
9. T. A. Davis. Direct Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2006.
10. P. Erdos and A. Rényi. On random graphs. Publicationes Mathematicae, 6(1):290-297, 1959.
11. R. A. V. D. Geijn and J. Watts. SUMMA: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience, 9(4):255-274, 1997.
12. J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. SIAM J. Sci. Comput., 19(6):2091-2110, 1998.
13. J. R. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in Matlab: Design and implementation. SIAM Journal of Matrix Analysis and Applications, 13(1):333-356, 1992.
14. F. G. Gustavson. Two fast algorithms for sparse matrices: Multiplication and permuted transposition. ACM Trans. Math. Softw., 4(3):250-269, 1978.
15. D. Irony, S. Toledo, and A. Tiskin. Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput., 64(9):1017-1026, 2004.
16. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The web as a graph: Measurements, models, and methods. In COCOON, pages 1-17, 1999.
17. M. Krishnan and J. Nieplocha. Srumma: A matrix multiplication algorithm suitable for clusters and scalable shared memory systems. In IPDPS, Los Alamitos, CA, USA, 2004. IEEE Computer Society.
18. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, and C. Faloutsos. Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In PKDD, pages 133-145, 2005.
19. G. Penn. Efficient transitive closure of sparse matrices over closed semirings. Theor. Comput. Sei., 354(1):72-81, 2006.
20. V. Shah and J. R. Gilbert. Sparse matrices in Matlab*P: Design and implementation. In HiPC, pages 144-155, 2004.
21. V. B. Shah. An Interactive System for Combinatorial Scientific Computing with an Emphasis on Programmer Productivity. PhD thesis, University of California, Santa Barbara, June 2007.