Parallel and fully recursive multifrontal sparse Cholesky

Future Generation Computer Systems

Volumn 20, Issue 3, 2004, Pages 425-440

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

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Block layouts; Cilk; Multifrontal factorizations; Parallel Cholesky factorization; Recursive factorizations; Recursive layouts; Sparse Cholesky factorization

Indexed keywords

BLOCK CODES; COMBINATORIAL MATHEMATICS; DATA REDUCTION; MATRIX ALGEBRA; MICROPROCESSOR CHIPS; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

BLOCK LAYOUTS; CILK; MULTIFRONTAL FACTORIZATIONS; PARALLEL CHLOESKY FACTORIZATION; RECURSIVE FACTORIZATIONS; RECURSIVE LAYOUTS; SPARSE CHLOESKY FACTORIZATION;

RECURSIVE FUNCTIONS;

EID: 1642372163     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2003.07.007     Document Type: Conference Paper

References (42)

1. Agarwal R.C., Gustavson F.G., Zubair M. Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM J. Res. Dev. 38(5):1994;563-576.
2. Agarwal R.C., Gustavson F.G., Zubair M. Improving performance of linear algebra algorithms for dense matrices using algorithmic prefetch. IBM J. Res. Dev. 38(3):1994;265-275.
3. Amestoy P.R., Duff I.S., Koster J., L'Excellent J. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23:2001;15-41.
4. P.R. Amestoy, I.S. Duff, J. L'Excellent, J. Koster, M. Tuma, MUltifrontal Massively Parallel Solver (MUMPS version 4.1), Specification Sheets, March 2000. http://www.enseeiht.fr/lima/apo/MUMPS/doc.html .
5. Andersen B.S., Waśniewski J., Gustavson F.G. A recursive formulation of Cholesky factorization of a matrix in packed storage. ACM Trans. Math. Softw. 27:2001;214-244.
6. Ashcraft C., Grimes R. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Softw. 15(4):1989;291-309.
7. J. Bilmes, K. Asanovic, C.W. Chin, 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.
8. L.S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, R.C. Whaley, ScaLAPACK User's Guide, SIAM, Philadelphia, PA, 1997. http://www.netlib.org.
9. R.D. Blumofe, Executing multithreaded programs efficiently, Ph.D. Thesis, MIT Department of Electrical Engineering and Computer Science, September 1995.
10. R.D. Blumofe, C.E. Leiserson, Scheduling multithreaded computations by work stealing, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, IEEE Computer Society Press, November 1994, pp. 356-368.
11. J. Choi, J. Dongarra, R. Pozo, D. Walker, ScaLAPACK: a scalable linear algebra for distributed memory concurrent computers, in: Proceedings of the Fourth Symposium on the Frontiers of Massively Parallel Computation, 1992, pp. 120-127. Also available as University of Tennessee Technical Report CS-92-181.
12. Compaq, Compaq Extended Math Library (CXML), 2001. http://www.compaq.com/math/.
13. J. Dongarra, R. Whaley, A User's Guide to the Blacs v1.0, Technical Report UT CS-95-281, LAPACK Working Note 94, University of Tennessee, 1995. http://www.netlib.org/blacs/.
14. Dongarra J.J., Cruz J.D., Hammarling S., Duff I. Algorithm 679: a set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16(1):1990;18-28.
15. Dongarra J.J., Cruz J.D., Hammarling S., Duff I. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16(1):1990;1-17.
16. J.J. Dongarra, 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, August 2000.
17. Duff I., Reid J. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 9:1983;302-325.
18. I.S. Duff, Parallel implementation of multifrontal schemes, Parallel Comput. 3 (1986).
19. Elmroth E., Gustavson F. Applying recursion to serial and parallel QR factorization leads to better performance. IBM J. Res. Dev. 44(4):2000;605-624.
20. Elmroth E., Gustavson F.G. A faster and simpler recursive algorithm for the LAPACK routine DGELS. BIT. 41:2001;936-949.
21. Frigo M., Leiserson C.E., Randall K.H. The implementation of the Cilk-5 multithreaded language. ACM SIGPLAN Notices. 33(5):1998;212-223.
22. Gilbert J.R., Moler C., Schreiber R. Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. Appl. 13(1):1992;333-356.
23. Gupta A., Karypis G., Kumar V. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans. Parallel Distrib. Syst. 8(5):1997;502-520.
24. F. Gustavson, A. Henriksson, I. Jonsson, B. Kågström, P. Ling, Recursive blocked data formats and BLAS's for dense linear algebra algorithms, in: B. Kågström, J. Dongarra, E. Elmroth, J. Waśniewski (Eds.), Proceedings of the Fourth International Workshop on Applied Parallel Computing and Large Scale Scientific and Industrial Problems (PARA'98), Lecture Notes in Computer Science Number 1541, Springer, Umeå, Sweden, June 1998, pp. 574-578.
25. Gustavson F.G. Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM J. Res. Dev. 41:1997;737-755.
26. Gustavson F.G., Jonsson I. Minimal-storage high-performance Cholesky factorization via blocking and recursion. IBM J. Res. Dev. 44:2000;823-850.
27. Hénon P., Ramet P., Roman J. PaStiX: a high-performance parallel direct solver for sparse symmetric definite systems. Parallel Comput. 28:2002;301-321.
28. IBM, Engineering and Scientific Subroutine Library (SCSL), 2001. http://www-1.ibm.com/servers/eservers/pseries/software/sp/essl.html.
29. Intel, Math Kernel Library (MKL), 2001. http://www.intel.com/software/products/mkl/.
30. D. Irony, G. Shklarski, S. Toledo, Parallel and fully recursive multifrontal supernodal sparse Cholesky, in: Proceedings of the International Conference on Computational Science (ICCS 2002), Part II, Amsterdam, April 2002, pp. 335-344.
31. M. Joshi, A. Gupta, F. Gustavson, G. Karypis, V. Kumar, PSPASES: scalable parallel direct solver library for sparse symmetric positive definite linear systems, in: User's Manual for Version 1.0.3, Technical Report TR 97-059, Department of Computer Science, University of Minnesota, 1997, revised 1999.
32. M. Joshi, A. Gupta, F. Gustavson, G. Karypis, V. Kumar, PSPASES: an efficient and scalable parallel sparse direct solver, in: Proceedings of the International Workshop on Frontiers of Parallel Numerical Computations and Applications (Frontiers'99), Annapolis, MD, February 1999, Unpublished article. http://www-users.cs.umn.edu/~mjoshi
33. Kamath C., Ho R., Manley D.P. DXML: a high-performance scientific subroutine library. Dig. Tech. J. 6(3):1994;44-56.
34. Liu J.W.H. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Trans. Math. Softw. 12(3):1986;249-264.
35. Liu J.W.H. The multifrontal method and paging in sparse Cholesky factorization. ACM Trans. Math. Softw. 15(4):1989;310-325.
36. Liu J.W.H. The multifrontal method for sparse matrix solution: theory and practice. SIAM Rev. 34(1):1992;82-109.
37. O. Schenk, K. Gärtner, Sparse factorization with two-level scheduling in PARADISO, in: Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, Portsmouth, VA, March 2001, p. 10 (CD-ROM).
38. SGI, Scientific Computing Software Library (SCSL), 1993-2002. http://www.sgi.com/software/scsl.html.
39. Cilk-5.3.2 Reference Manual, Supercomputing Technologies Group, MIT Laboratory for Computer Science, Cambridge, MA, November 2001. http://supertech.lcs.mit.edu/cilk.
40. MATLAB Reference Guide, August 1992, The MathWorks Inc., Natick, MA.
41. Toledo S. Locality of reference in LU decomposition with partial pivoting. SIAM J. Matrix Anal. Appl. 18(4):1997;1065-1081.
42. R.C. Whaley, J.J. Dongarra, Automatically tuned linear algebra software, Technical Report, Computer Science Department, University of Tennessee, 1998, http://www.netlib.org/atlas .