Parallel and fully recursive multifrontal supernodal sparse cholesky

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2330, Issue , 2002, Pages 335-344

  Irony, Dror ^a   Shklarski, Gil ^a   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FACTORIZATION; ARTIFICIAL INTELLIGENCE;

CHOLESKY; DATA LAYOUTS; DENSE MATRICES; MULTIFRONTAL; SPARSE CHOLESKY FACTORIZATIONS; SUB-MATRICES;

C (PROGRAMMING LANGUAGE); COMPUTER SCIENCE;

EID: 84886852438     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46080-2_35     Document Type: Article

References (26)

1. R. C. Agarwal, F. G. Gustavson, and M. Zubair. Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM Journal of Research and Development, 38(5):563-576, 1994.
2. R. C. Agarwal, F. G. Gustavson, and M. Zubair. Improving performance of linear algebra algorithms for dense matrices using algorithmic prefetch. IBM Journal of Research and Development, 38(3):265-275, 1994.
3. B. S. Andersen, J. Wásniewski, and F. G. Gustavson. A recursive formulation of cholesky factorization of a matrix in packed storage. ACM Transactions on Mathematical Software, 27:214-244, June 2001.
4. J. Bilmes, K. Asanovic, C. W. Chin, and J. Demmel. Optimizing matrix multiply using PHIPAC: a portable, high-performance, ANSI C coding methodology. In Proceedings of the International Conference on Supercomputing, Vienna, Austria, 1997.
5. Compaq. Compaq extended math library (CXML). Software and documuntation available online from http://www.compaq.com/math/, 2001.
6. J. J. Dongarra, J. D. Cruz, S. Hammarling, and I. Duff. Algorithm 679: A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software, 16(1):18-28, 1990.
7. J. J. Dongarra, J. D. Cruz, S. Hammarling, and I. Duff. A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software, 16(1):1-17, 1990.
8. J. J. Dongarra and P. Raghavan. A new recursive implementation of sparse Cholesky factorization. In Proceedings of the 16th IMACS World Congress 2000 on Scientific Computing, Applications, Mathematics, and Simulation, Lausanne, Switzerland, Aug. 2000.
9. 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.
10. E. Elmroth and F. G. Gustavson. A faster and simpler recursive algorithm for the LAPACK routine DGELS. BIT, 41:936-949, 2001.
11. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. ACM SIGPLAN Notices, 33(5):212-223, 1998.
12. F. Gustavson, A. Henriksson, I. Jonsson, B. Ka°gström, and P. Ling. Recursive blocked data formats and BLAS's for dense linear algebra algorithms. In B. K°agstr̈om, J. Dongarra, E. Elmroth, and J. Wásniewski, editors, Proceedings of the 4th International Workshop on Applied Parallel Computing and Large Scale Scientific and Industrial Problems (PARA '98), number 1541 in Lecture Notes in Computer Science Number, pages 574-578, Ume, Sweden, June 1998. Springer.
13. F. G. Gustavson. Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Research and Development, 41:737-755, Nov. 1997.
14. F. G. Gustavson and I. Jonsson. Minimal-storage high-performance Cholesky factorization via blocking and recursion. IBM Journal of Research and Development, 44:823-850, Nov. 2000.
15. IBM. Engineering and scientific subroutine library (SCSL). Software and documuntation available online from http://www-1.ibm.com/servers/eservers/ pseries/software/sp/essl.html, 2001.
16. Intel. Math kernel library (MKL). Software and documuntation available online from http://www.intel.com/software/products/mkl/, 2001.
17. C. Kamath, R. Ho, and D. P. Manley. DXML: a high-performance scientific subroutine library. Digital Technical Journal, 6(3):44-56, 1994.
18. J. W. H. Liu. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software, 12(3):249-264, 1986.
19. J. W. H. Liu. The multifrontal method and paging in sparse Cholesky factorization. ACM Transactions on Mathematical Software, 15(4):310-325, 1989.
20. J.W. H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34(1):82-109, 1992.
21. E. G. Ng and B. W. Peyton. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM Journal on Scientific Computing, 14(5):1034-1056, 1993.
22. O. Schenk and K. Gärtner. Sparse factorization with two-level scheduling in PARADISO. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, page 10 pages on CDROM, Portsmouth, Virginia, Mar. 2001.
23. SGI. Scientific computing software library (SCSL). Software and documuntation available online from from http://www.sgi.com/software/scsl.html, 1993-2001.
24. Supercomputing Technologies Group, MIT Laboratory for Computer Science, Cambridge, MA. Cilk-5.3 Reference Manual, June 2000. Available online at http://supertech.lcs.mit.edu/cilk.
25. S. Toledo. Locality of reference in LU decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications, 18(4):1065-1081, 1997.
26. R. C. Whaley and J. J. Dongarra. Automatically tuned linear algebra software. Technical report, Computer Science Department, University Of Tennessee, 1998. available online at www.netlib.org/atlas.