Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem
暂无分享,去创建一个
James Demmel | Laura Grigori | Sylvain Peyronnet | Pierre-Yves David | J. Demmel | L. Grigori | Sylvain Peyronnet | P. David
[1] Oded Schwartz,et al. Communication-optimal parallel and sequential Cholesky decomposition: extended abstract , 2009, SPAA.
[2] Dror Irony,et al. Communication lower bounds for distributed-memory matrix multiplication , 2004, J. Parallel Distributed Comput..
[3] A. H. Sherman,et al. Applications of an Element Model for Gaussian Elimination , 1976 .
[4] Keshav Pingali,et al. Automatic Generation of Block-Recursive Codes , 2000, Euro-Par.
[5] Vipin Kumar,et al. Highly Scalable Parallel Algorithms for Sparse Matrix Factorization , 1997, IEEE Trans. Parallel Distributed Syst..
[6] James Demmel,et al. Communication-optimal Parallel and Sequential Cholesky Decomposition , 2009, SIAM J. Sci. Comput..
[7] James Demmel,et al. Communication-optimal Parallel and Sequential QR and LU Factorizations , 2008, SIAM J. Sci. Comput..
[8] D. Rose,et al. Generalized nested dissection , 1977 .
[9] James Demmel,et al. Communication avoiding Gaussian elimination , 2008, HiPC 2008.
[10] H. T. Kung,et al. I/O complexity: The red-blue pebble game , 1981, STOC '81.
[11] Alan George,et al. Communication results for parallel sparse Cholesky factorization on a hypercube , 1989, Parallel Comput..
[12] James Demmel,et al. Minimizing Communication in Linear Algebra , 2009, ArXiv.
[13] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .