Efficient sparse LU factorization with partial pivoting on distributed memory architectures

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 2, 1998, Pages 109-125

  Fu, Cong ^b   Jiao, Xiangmin ^c   Yang, Tao ^a,d  

^a IEEE   (United States)

^b Siemens Pyramid Information Systems   (United States)

^c University of Illinois at Urbana Champaign   (United States)

^d University of California   (United States)

Author keywords

Asynchronous computation scheduling; Dense structures; Gaussian elimination with partial pivoting; Irregular parallelism; Sparse LU factorization

Indexed keywords

BUFFER STORAGE; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

DISTRIBUTED MEMORY MACHINES; GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING (GEPP);

DATA STORAGE EQUIPMENT;

EID: 0031998732     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.663864     Document Type: Article

References (36)

1. C. Ashcraft and R. Grimes, "The Influence of Relaxed Supernode Partitions on the Multifrontal Method," ACM Trans. Mathematical Software, vol. 15, no. 4, pp. 291-309, 1989.
2. C. Ashcraft, R. Grimes, J. Lewis, B. Peyton, and H. Simon, "Progress in Sparse Matrix Methods for Large Sparse Linear Systems on Vector Supercomputers," Int'l J. Supercomputer Applications, vol. 1, pp. 10-30, 1987.
3. T. Davis, "User's Guide for the Unsymmetric-Pattern Multifrontal Package (UMFPACK)," Technical Report TR-93-020, Computer and Information Sciences Dept., Univ. of Florida, June 1993.
4. T. Davis, personal communication, 1997.
5. T. Davis and I.S. Duff, "An Unsymmetric-Pattern Multifrontal Method for Sparse LU factorization," SIAM Matrix Analysis & Applications, Jan. 1997.
6. J. Demmel, "Numerical Linear Algebra on Parallel Processors," Lecture Notes for NSF-CBMS Regional Conf. Mathematical Sciences, June 1995.
7. J. Demmel, S. Eisenstat, J. Gilbert, X. Li, and J. Liu, "A Supernodal Approach to Sparse Partial Pivoting," Technical Report CSD-95-883, Univ. of California at Berkeley, Sept.1995.
8. J. Demmel, J. Gilbert, and X. Li, "An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination," Technical Report CSD-97-943, Univ. of California at Berkeley, Feb. 1997.
9. J. Dongarra, J. Du Croz, S. Hammarling, and R. Hanson, "An Extended Set of Basic Linear Algebra Subroutines," ACM Trans. Mathematical Software, vol. 14, pp. 18-32, 1988.
10. I. Duff and J. Reid, "The Multifrontal Solution of Indefinite Sparse Symmetric Systems of Equations," ACM Trans. Mathematical Software, vol. 9, pp. 302-325, 1983.
11. I.S. Duff, "On Algorithms for Obtaining a Maximum Transversal," ACM Trans. Mathematical Software, vol. 7, no. 3, pp. 315-330, Sept. 1981.
12. I.S. Duff, personal communication, 1996.
13. S. Eisenstat and J.W.H. Liu, "Structural Representations of Schur Complements in Sparse Matrices," Graph Theory and Sparse Matrix Computation, A. George, J.R. Gilbert, and J.W.H. Liu, eds., vol. 56, pp. 85-100. New York: Springer-Verlag, 1993.
14. C. Fu, X. Jiao, and T. Yang, "A Comparison of 1-D and 2-D Data Mapping for Sparse LU Factorization with Partial Pivoting," Proc. Eighth SIAM Conf. Parallel Processing for Scientific Computing, Mar. 1997.
15. C. Fu and T. Yang, "Efficient Run-time Support for Irregular Task Computations with Mixed Granularities," Proc. IEEE Int'l Parallel Processing Symp., pp. 823-830, Hawaii, Apr. 1996.
16. C. Fu and T. Yang, "Run-Time Compilation for Parallel Sparse Matrix Computations," Proc. ACM Int'l Conf. Supercomputing, pp. 237-244, Philadelphia, May 1996.
17. C. Fu and T. Yang, "Sparse LU Factorization with Partial Pivoting on Distributed Memory Machines," Proc. ACM/IEEE Supercomputing, Pittsburgh, Nov. 1996.
18. C. Fu and T. Yang, "Space and Time Efficient Execution of Parallel Irregular Computations," Proc. Sixth ACM SIGPLAN Symp. Principles & Practice of Parallel Programming, pp. 57-68, June 1997.
19. K. Gallivan, B. Marsolf, and H. Wijshoff, "The Parallel Solution of Nonsymmetric Sparse Linear Systems Using H* Reordering and an Associated Factorization," Proc. ACM Int'l Conf. Supercomputing, pp. 419-430, Manchester, England, July 1994.
20. A. George and E. Ng, "Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting," SIAM J. Scientific and Statistical Computing, vol. 8, no. 6, pp. 877-898, Nov. 1987.
21. A. George and E. Ng, "Parallel Sparse Gaussian Elimination with Partial Pivoting," Annals of Operations Research, vol. 22, pp. 219-240, 1990.
22. A. Gerasoulis and T. Yang, "On the Granularity and Clustering of Directed Acyclic Task Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 6, pp. 686-701, June 1993.
23. G. Golub and J.M. Ortega, Scientific Computing: An Introduction with Parallel Computing Compilers. Academic Press, 1993.
24. A. Gupta and V. Kumar, "Highly Scalable Parallel Algorithms for Sparse Matrix Factorization," Technical Report TR 94-63, Computer Science Dept., Univ. of Minnesota, Aug. 1994.
25. S. Hadfield and T. Davis, "A Parallel Unsymmetric-Pattern MultiFrontal Method," Technical Report TR-94-028, Computer and Information Sciences Dept., Univ. of Florida, Aug. 1994.
26. M. Heath, E. Ng, and B. Peyton, "Parallel Algorithms for Sparse Linear Systems," SIAM Review, vol. 33, no. 3, pp. 420-460, Sept. 1991.
27. X. Jiao, "Parallel Sparse Gaussian Elimination with Partial Pivoting and 2-D Data Mapping," master's thesis, Dept. of Computer Science, Univ. of California at Santa Barbara, Aug. 1997.
28. J.W.H. Liu, "Computational Models and Task Scheduling for Parallel Sparse Cholesky Factorization," Parallel Computing, vol. 18, pp. 327-342, 1986.
29. P. Raghavan, "Distributed Sparse Gaussian Elimination and Orthogonal Factorization," SIAM J. Scientific Computing, vol. 16, no. 6, pp. 1,462-1,477, Nov. 1995.
30. E. Rothberg, "Exploiting the Memory Hierarchy in Sequential and Parallel Sparse Cholesky Factorization," PhD thesis, Dept. of Computer Science, Stanford Univ., Calif., Dec. 1992.
31. E. Rothberg and R. Schreiber, "Improved Load Distribution in Parallel Sparse Cholesky Factorization," Proc. Supercomputing'94, pp. 783-792, Nov. 1994.
32. S.L. Scott, "Synchronization and Communication in the T3E Multiprocess," Proc. ASPLOS-VII, Oct. 1996.
33. S.L. Scott and G.M. Thorson, "The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus," Proc. HOT Interconnects IV, Aug. 1996.
34. T. Stricker, J. Stichnoth, D. O'Hallaron, S. Hinrichs, and T. Gross, "Decoupling Synchronization and Data Transfer in Message Passing Systems of Parallel Computers," Proc. Int'l Conf. Supercomputing, pp. 1-10, Barcelona, July 1995.
35. C. Sun, "Parallel Sparse Orthogonal Factorization on Distributed-memory Multiprocessors," SIAM J. Scientific Computing, vol. 17, no. 3, pp. 666-685, May 1996.
36. T. Yang and A. Gerasoulis, "PYRROS: Static Task Scheduling and Code Generation for Message-Passing Multiprocessors," Proc. Sixth ACM Int'l Conf. Supercomputing, pp. 428-437, 1992.