An asynchronous parallel supernodal algorithm for sparse Gaussian elimination

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 4, 1999, Pages 915-952

  Demmel, James W ^a   Gilbert, John R ^b   Li, Xiaoye S ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

^c LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Dynamic scheduling and load balancing; Parallelism; Sparse Gaussian elimination; Supernodes; Unsymmetric linear systems

Indexed keywords

EID: 0033242228     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897317685     Document Type: Article

References (34)

1. P. R. AMESTOY AND I. S. DUFF, MUPS: A Parallel Package for Solving Sparse Unsymmetric Sets of Linear Equations, Technical report, CERFACS, Toulouse, France, 1994.
2. P. R. AMESTOY, Factorization of Large Unsymmetric Sparse Matrices Based on a Multifrontal Approach in a Multiprocessor Environment, Technical report TH/PA/91/2 and Ph.D. thesis, CERFACS, Toulouse, France, February 1991.
3. C. ASHCRAFT AND R. GRIMES, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software, 15 (1989), pp. 291-309.
4. J. BILMES, K. ASANOVIC, J. DEMMEL, D. LAM, AND C.-W. CHIN, Optimizing Matrix Multiply Using PHiPAC: A Portable, High-performance, ANSI C Coding Methodology, Technical report CS-96-326, Computer Science Dept., University of Tennessee, Knoxville, TN, May 1996 (LAPACK Working Note 111).
5. T. A. DAVIS AND P.-C. YEW, A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 383-402.
6. J. W. DEMMEL, S. C. EISENSTAT, J. R. GILBERT, X. S. LI, AND J. W. H. LIU, A supernodal approach to sparse partial pivoting, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 720-755.
7. J. DONGARRA, J. DU CROZ, S. HAMMARLING, AND R. J. HANSON, An extended set of FORTRAN basic linear algebra subprograms. ACM Trans. Math. Software, 14 (1988), pp. 1-17.
8. J. DONGARRA, J. DU CROZ, I. S. DUFF. AND S. HAMMARLING, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Software, 16 (1990), pp. 1-17.
9. I. S. DUFF. R. GRIMES, AND J. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
10. S. C. EISENSTAT AND J. W. H. LIU, Exploiting structural symmetry in unsymmetric sparse symbolic factorization, SIAM J. Matrix Anal. Appl, 13 (1992), pp. 202-211.
11. S. C. EISENSTAT AND J. W.H. LIU, Exploiting structural symmetry in a sparse partial pivoting code, SIAM J. Sci. Comput., 14 (1993), pp. 253-257.
12. D. M. FENWICK. D. J. FOLEY, W. B. GIST, S. R. VANDOREN, AND D. WISSEL, The AlphaServer 8000 series: High-end server platform development, Digital Tech, J., 7 (1995), pp. 43-65.
13. A. GEORGE, M. T. HEATH, J. LIU, AND E. NG, Solution of sparse positive definitive systems on a shared-memory multiprocessor, Internat. J. Parallel Programming, 15 (1986), pp. 309-325.
14. A. GEORGE, J. LIU, AND E. NG, A data structure for sparse QR and LU factorizations, SIAM J. Sci. Stat. Comput., 9 (1988), pp. 100-121.
15. A. GEORGE AND E. NG, An implementation of Gaussian elimination with partial pivoting for sparse systems, SIAM J. Sci. Stat. Comput., 6 (1985), pp. 390-409.
16. A. GEORGE AND E. NG, Symbolic factorization for sparse Gaussian elimination with partial pivoting, SIAM J. Sci. Stat. Comput., 8 (1987), pp. 877-898.
17. A. GEORGE AND E. NG, Parallel sparse Gaussian elimination with partial pivoting, Ann. Oper. Res., 22 (1990), pp. 219-240.
18. J. R. GILBERT, C. MOLER, AND R. SCHREIBER, Sparse matrices in Matlab: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
19. J. R. GILBERT AND E. G. NG, Predicting structure in nonsymmetric sparse matrix factorizations, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, New York, 1993, pp. 107-139.
20. J. R. GILBERT, An Efficient Parallel Sparse Partial Pivoting Algorithm, Technical report CMI 88/45052-1, Christian Michelsen Institute, Bergen, Norway, 1988.
21. J. R. GILBERT, E. G. NG, AND B. W. PEYTON, Computing row and column counts for sparse QR factorization, talk presented at Fifth SIAM Conference on Applied Linear Algebra, Snowbird, UT, June 1994; journal version in preparation.
22. J. R. GILBERT, E. G. NG, AND B. W. PEYTON, An efficient algorithm to compute row and column counts for sparse Cholesky factorization, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 1075-1091.
23. A. GUPTA AND V. KUMAR, Optimally scalable parallel sparse Cholesky factorization, in Proc. 7th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1995, pp. 442-447.
24. A. GUPTA, E. ROTHBERG, E. NG. AND B. W. PEYTON, Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems, in Advances in Computer Methods for Partial Differential Equations-VII, R. Vichnevetsky, D. Knight, and G. Richter, eds., IMACS, New Brunswick, NJ, 1992, pp. 622-628.
25. X. S. LI, Sparse Gaussian Elimination on High Performance Computers, Technical report UCB//CSD-96-919 and Ph.D. thesis, Computer Science Division, University of California, Berkeley, CA, September 1996.
26. J. W. H. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
27. J. W. H. LIU, E. G. NG, AND B. W. PEYTON, On finding supernodes for sparse matrix computations, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 242-252.
28. E. NG AND B. W. PEYTON, A supernodal Cholesky factorization algorithm for shared-memory multiprocessors, SIAM J. Sci. Comput., 14 (1993), pp. 761-769.
29. E. ROTHBERG, Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers, SIAM J. Sci. Comput., 17 (1996), pp. 699-713.
30. SGI Power Challenge, Technical report, Silicon Graphics, Mountain View, CA, 1995.
31. SPARCcenter 2000 architecture and implementation, Technical white paper, Sun Microsystems, Inc., Mountain View, CA, November 1993.
32. S. A. VAVASIS, Stable finite elements for problems with wild coefficients, SIAM J. Numer. Anal., 33 (1996), pp. 809-916.
33. The Cray C90 series, Cray Research, Inc., Eagen, MN, http://www.cray.com/swpubs/
34. The Cray J90 series, Cray Research, Inc., Eagen, MN, http://www.cray.com/swpubs/