Minimizing communication in sparse matrix solvers

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, SC '09

Volumn , Issue , 2009, Pages

  Mohiyuddin, Marghoob ^a,b   Hoemmen, Mark ^a   Demmel, James ^a   Yelick, Katherine ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE RATES; DATA-COMMUNICATION; MATRIX; MATRIX-VECTOR; MATRIX-VECTOR PRODUCTS; MEMORY SYSTEMS; MULTIPLE NODES; NUMERICAL STABILITIES; PARALLEL MACHINE; SHARED MEMORIES; SINGLE PROCESSORS; SPARSE MATRICES; VECTOR OPERATIONS;

COMMUNICATION; CONVERGENCE OF NUMERICAL METHODS; ONLINE SEARCHING;

MATRIX ALGEBRA;

EID: 74049146136     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1654059.1654096     Document Type: Conference Paper

References (24)

1. Z. Bai, D. Hu, and L. Reichel. A Newton basis GMRES implementation. IMA Journal of Numerical Analysis, 14:563-581, 1994.
2. A. T. Chronopoulos and C. W. Gear. s-step iterative methods for symmetric linear systems. J. Comput. Appl. Math., 25(2):153-168, 1989.
3. J. Cullum and W. E. Donath. A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large sparse real symmetric matrices. In Proceedings of the 1974 IEEE Conference on Decision and Control, pages 505-9, Phoenix, AZ, 1974.
4. E. de Sturler. A parallel variant of GMRES(m). In J. J. H. Miller and R. Vichnevetsky, editors, Proceedings of the 13th IMACS World Congress on Computation and Applied Mathematics, Dublin, Ireland, 1991. Criterion Press.
5. J. Demmel, L. Grigori, M. Hoemmen, and J. Langou. Communication-optimal parallel and sequential QR and LU factorizations. Technical Report UCB/EECS-2008-89, University of California EECS, May 2008. Submitted to SIAM J. Sci. Comput.
6. J. Demmel, Y. Hida, M. Hoemmen, and E. J. Riedy. Non-negative diagonals and high performance on low-profile matrices from Householder QR. SIAM J. Sci. Comput., 31(4):2832-2841, July 2009.
7. J. Demmel and M. Hoemmen. Communication-avoiding Krylov subspace methods. Technical report, University of California Berkeley EECS, in preparation.
8. J. Demmel, M. Hoemmen, M. Mohiyuddin, and K. Yelick. Avoiding communication in computing Krylov subspaces. Technical Report UCB/EECS-2007-123, University of California Berkeley EECS, October 2007.
9. J. Demmel, M. Hoemmen, M. Mohiyuddin, and K. Yelick. Avoiding Communication in Sparse Matrix Computations. In Proceedings of IPDPS, April 2008.
10. E. Elmroth and F. Gustavson. Applying recursion to serial and parallel QR factorization leads to better performance. IBM Journal of Research and Development, 44(4):605-624, 2000.
11. J. Erhel. A parallel GMRES version for general sparse matrices. Electronic Transactions on Numerical Analysis, 3:160-176, 1995.
12. K. Goto and R. A. van de Geijn. Anatomy of high-performance matrix multiplication. Transactions on Mathematical Software, 34(3), 2008.
13. E.-J. Im, K. Yelick, and R. Vuduc. SPARSITY: An Optimization Framework for Sparse Matrix Kernels. Int. J. HPCA, February 2004.
14. W. D. Joubert and G. F. Carey. Parallelizable restarted iterative methods for nonsymmetric linear systems, Part I: Theory. International Journal of Computer Mathematics, 44:243-267, 1992.
15. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. In International Conference on Parallel Processing, 1995.
16. R. B. Morgan. Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations. SIAM J. Mat. Anal. Appl., 21(4):1112-1135, 2000.
17. R. Nishtala and K. Yelick. Optimizing collective communication on multicores. In First USENIX Workshop on Hot Topics in Parallelism, 2009.
18. D. O'Leary. The block conjugate gradient algorithm and related methods. Linear Algebra Appl., 29:293-322, 1980.
19. M. L. Parks, E. de Sturler, G. Mackey, D. Johnson, and S. Maiti. Recycling Krylov subspaces for sequences of linear systems. SIAM J. Sci. Comput., 28(5):1651-1674, 2006.
20. Y. Saad and M. H. Schultz. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput., 7(3), 1986.
21. S. A. Toledo. Quantitative performance modeling of scientific computations and creating locality in numerical algorithms. PhD thesis, Massachusetts Institute of Technology, 1995.
22. R. Vuduc. Automatic Performance Tuning of Sparse Matrix Kernels. PhD thesis, University of California Berkeley EECS, 2003.
23. H. F. Walker. Implementation of the GMRES method using Householder transformations. SIAM J. Sci. Stat. Comput., 9(1):152-163, 1988.
24. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of Sparse Matrix-Vector Multiplication on Emerging Multicore Platforms. In Proc. of Supercomputing, 2007.