Data-parallel sparse LU factorization

SIAM Journal on Scientific Computing

Volumn 19, Issue 2, 1998, Pages 584-604

  Conroy, John M ^a   Kratzer, Steven G ^a   Lucas, Robert F ^a   Naiman, Aaron E ^a  

^a INSTITUTE FOR DEFENSE ANALYSES   (United States)

Author keywords

Data parallel algorithms; Direct method; Parallel algorithms; SIMD; Sparse linear systems

Indexed keywords

EID: 11744349596     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827594276412     Document Type: Article

References (48)

1. P. AMESTOY AND I. DUFF, Vectorization of a multiprocessor multifrontal code, Internat. J. Supercomput. Appl., 3 (1989), pp. 41-59.
2. C. ASHCRAFT, S. EISENSTAT, AND J. LIU, A Comparison of Three Column-Based Distributed Sparse Factorization Schemes, Tech. report YALEU/DCS/RR-810, Department of Computer Science, Yale University, New Haven, CT, 1990.
3. M. PINTO, C. RAFFERTY, AND R. DUTTON, PISCES-II: Poison and Continuity Solver: Users Manual, Stanford Electronics Laboratory, Stanford University, Stanford, CA, 1984.
4. C. ASHCRAFT AND R. GRIMES, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software, 15 (1989), pp. 291-309.
5. C. ASHCRAFT, The fan-both family of column-based distributed Cholesky factorization algorithms, in Graph Theory and Sparse Matrix Computation, IMA Vol. Math. Appl. 56, Springer-Verlag, New York, 1993, pp. 191-209.
6. K. BATCHER, Staran parallel processor system hardware, in AFIPS Conference Proceedings 43, American Federation of Information Processing Societies, 1974, pp. 405-410.
7. K. BATCHER, Design of a massively parallel processor, IEEE Trans. Comput., 29 (1980), pp.
8. D. BLEVINS, E. DAVIS, R. HEATON, AND J. REID, Blitzen: A highly integrated massively parallel machine, J. Parallel Distrib. Comput., 8 (1990), pp. 150-160.
9. T. BLANK, The MasPar MP-1 architecture, in Proc. Compcon Spring '90, February 1990, IEEE, Piscataway, NJ, 1990, pp. 20-24.
10. B. CHAPMAN, P. MEHROTRA, AND H. ZIMA, Programming in Vienna Fortran, Sci. Programming, 1 (1992), pp. 31-50.
11. J. CONROY, Parallel nested dissection, Parallel Comput., 16 (1990), pp. 139-156.
12. W. CARLSON AND J. SCHLESINGER, AC: A Language and Compiler for the CM-5 Node Architecture, Tech. report SRC-TR-93-094, Supercomputing Research Center, Bowie, MD, 1993.
13. J. DEMMEL, Trading Off Parallelism and Numerical Stability, Tech. report CS 92-179, University of Tennessee, Knoxville, TN, 1992.
14. I. DUFF, A. ERISMAN, AND J. REID, Direct Methods for Sparse Matrices, Oxford University Press, London, 1986.
15. I. DUFF, R. GRIMES, AND J. LEWIS, Sparse Matrix Test Problems, Tech. report TM90, Mathematics and Computer Sciences Division, Argonne National Laboratory, Argonne, IL, 1988.
16. J. DONGARRA, Performance of Various Computers Using Standard Linear Equations Software, Tech. report CS-89-85, University of Tennessee, Knoxville, TN, 1994.
17. I. DUFF AND J. REID, The multifrontal solution of indefinite sparse symmetric linear systems, ACM Trans. Math. Software, 9 (1983), pp. 302-335.
18. [Duf86] I. DUFF, Parallel implementation of multifrontal schemes, Parallel Comput., 3 (1986), pp. 193-204.
19. J. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
20. J. A. GEORGE AND J. W.-H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
21. A. GEORGE, W. POOLE, AND R. VOIGT, Incomplete nested dissection for solving n × n grid problems, SIAM J. Numer. Anal., 15 (1978), pp. 662-673.
22. R. GRIMES, private communication, 1993.
23. J. GILBERT AND R. SCHREIBER, Highly parallel sparse Cholesky factorization, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 1151-1172.
24. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
25. D. HILLIS, The Connection Machine, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1985.
26. M. HEATH, E. NG, AND B. PEYTON, Parallel algorithms for sparse linear systems, SIAM Rev., 33 (1991), pp. 420-460.
27. K. IOBST AND T. TURNBULL, The TERASYS Reference Manual, Tech. report SRC-TR-93-103, Supercomputing Research Center, Bowie, MD, 1993.
28. S. KRATZER, Sparse LU Factorization on Massively Parallel SIMD Computers, Tech. report SRC-TR-92-072, Supercomputing Research Center, Bowie, MD, 1992.
29. D. KUCK AND R. STOKES, The Burroughs Scientific Processor (BSP), IEEE Trans. Comput., 31 (1982), pp. 363-376.
30. R. LUCAS, W. BLANK, AND J. TIEMANN, A parallel solution method for large sparse systems of equations, IEEE Trans. Comput. Aided Design, CAD-6 (1987), pp. 981-991.
31. F. MANNE, Load Balancing in Parallel Sparse Matrix Computations, Ph.D. thesis, Department of Informatics, University of Bergen, Bergen, Norway, 1993.
32. R. MINNICH, Mether: A Memory System for Network Multiprocessors, Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, 1990.
33. The MPL Users Manual, MasPar Corporation, Sunnyvale, CA, 1991.
34. A. POTHEN AND C. SUN, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput., 14 (1993), pp. 1253-1257.
35. S. REDDAWAY, DAP - a distributed array processor, in 1st Annual Symposium on Computer Architecture, IEEE/ACM, FL, 1963, p. 61.
36. E. ROTHBERG AND A. GUPTA, An efficient block-oriented approach to parallel sparse Cholesky factorization, in Proc. Supercomputing 1993, IEEE, Washington, DC, 1993, pp. 503-512.
37. E. ROTHBERG, private communication, 1993.
38. E. ROTHBERG, Exploiting the Memory Heirarchy in Sequential and Parallel Sparse Cholesky Factorization, Ph.D. thesis, Stanford University, Stanford, CA, 1993.
39. D. SLOTNICK, W. BORCK, AND R. MCREYNOLDS, The SOLOMAN computer, in AFIPS Conference Proceedings 22, American Federation of Information Processing Societies, 1962, pp. 97-107.
40. R. SCHREIBER, private communication, 1993.
41. R. SCHREIBER, An assessment of the Connection Machine, Internat. J. High Speed Comput., 5 (1993), pp. 523-535.
42. D. SLOTNICK, Unconventional systems, in AFIPS Conference Proceedings 30, American Federation of Information Processing Societies, 1967, pp. 477-481.
43. H. STONE, A logic-in-memory computer, IEEE Trans. Comput., 19 (1970), pp. 73-78.
44. The CM Fortran Users Manual, Thinking Machines Corporation, Cambridge, MA, 1991.
45. The Connection Machine CM-200 Technical Summary, Thinking Machines Corporation, Cambridge, MA, June 1991.
46. The Connection Machine CM-5 Technical Summary, Thinking Machines Corporation, Cambridge, MA, October 1991.
47. C. YANG, A Vector/Parallel Implementation of the Multifrontal Method for Sparse Symmetric Definite Linear Systems on the Cray Y-MP, Tech. report Cray Research Inc., Mendota Heights, MN, 1990.
48. SIAM J. Sei. COMPUT. Vol. 19, No. 2, pp. 605-625, March 1998