Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 79-81

  Grigori, Laura ^a   David, Pierre Yves ^a   Demmel, James W ^b   Peyronnet, Sylvain ^c  

^a INRIA SACLAY   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Communication bounds; Sparse cholesky

Indexed keywords

FACTORIZATION; MEMORY ARCHITECTURE; PARALLEL ALGORITHMS;

CHOLESKY; CHOLESKY FACTORIZATIONS; LINEAR ALGEBRA ALGORITHMS; MATRIX MULTIPLY; QR FACTORIZATIONS; SEQUENTIAL ALGORITHM; SPARSE CHOLESKY FACTORIZATIONS; SPARSE MATRICES;

MATRIX ALGEBRA;

EID: 77954898947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810496     Document Type: Conference Paper

References (12)

1. N. Ahmed and K. Pingali. Automatic generation of block-recursive codes. In Springer-Verlag, editor, Euro-Par, 2000, pages 368-378, 2000.
2. G. Ballard, J. Demmel, O. Holtz, and O. Schwartz. Communication-optimal parallel and sequential Cholesky decomposition. ACM SPAA, 2009.
3. G. Ballard, J. Demmel, O. Holtz, and O. Schwartz. Minimizing communication in linear algebra. Technical Report UCB/EECS-2009-62, UC Berkeley, 2009.
4. J. Demmel, L. Grigori, M. Hoemmen, and J. Langou. Communication-optimal parallel and sequential QR and LU factorizations. Technical Report UCB/EECS-2008-89, UC Berkeley, 2008. LAPACK Working Note 204.
5. S. C. Eisenstat, M. H. Schultz, and A. H. Sherman. Applications of an element model for Gaussian elimination. In J. Bunch and D. Rose, editors, Sparse Matrix Computations, pages 85-96. Academic Press, New York, 1976.
6. A. George. Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis, 10:345-363, 1973.
7. A. George, J. W.-H. Liu, and E. G. Ng. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Computing, 10(3):287-298, 1989.
8. L. Grigori, J. W. Demmel, and H. Xiang. Communication avoiding Gaussian elimination. Proceedings of the ACM/IEEE SC08 Conference, 2008.
9. A. Gupta, G. Karypis, and V. Kumar. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Transactions on Parallel and Distributed Systems, 8(5), 1995.
10. J.-W. Hong and H. T. Kung. I/O complexity: The Red-Blue Pebble Game. In STOC '81: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pages 326-333, New York, NY, USA, 1981. ACM.
11. D. Irony, S. Toledo, and A. Tiskin. Communication lower bounds for distributed-memory matrix multiplication. Journal of Parallel and Distribed Computing, 64(9):1017-1026, 2004.
12. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM Journal on Numerical Analysis, 16:346-358, 1979.