Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers

SIAM Journal on Scientific Computing

Volumn 17, Issue 3, 1996, Pages 699-713

  Rothberg, Edward ^a,b  

^a INTEL CORPORATION   (United States)

^b HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

Parallel machines; Scalability; Sparse Cholesky factorization; Sparse matrices

Indexed keywords

EID: 0001102965     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S106482759426715X     Document Type: Article

References (21)

1. P. AMESTOY AND I. DUFF, Vectorization of a multiprocessor multifrontal code, Internat. J. Supercomputer Appl., 3 (1989), pp. 41-59.
2. C. C. ASHCRAFT, S. C. EISENSTAT, J. L. LIU, AND A. H. SHERMAN, A Comparison of Three Column-Based Distributed Sparse Factorization Schemes, Research Report YALEU/DCS/RR-810, Computer Science Department, Yale University, New Haven, CT, 1990.
3. C. C. ASHCRAFT AND R. G. GRIMES, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software, 15 (1989), pp. 291-309.
4. C. C. ASHCRAFT, R. G. GRIMES, J. G. LEWIS, B. W. PEYTON, AND H. D. SIMON, Recent progress in sparse matrix methods for large linear systems, Internat. J. Supercomputer Appl., 1 (1987), pp. 10-30.
5. J. DONGARRA, J. Du CROZ, S. HAMMARLING, AND I. DUFF, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Software, 16 (1990), pp. 1-17.
6. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
7. G. Fox, et al., Solving Problems on Concurrent Processors: General Techniques and Regular Problems, Prentice-Hall, Englewood Cliffs, NJ, 1988.
8. A. GEORGE, M. HEATH, J. LIU, AND E. NG, Solution of Sparse Positive Definite Systems on a Hypercube, Tech. Report TM-10865, Oak Ridge National Laboratory, Oak Ridge, TN, 1988.
9. A. GEORGE AND J. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffis ,NJ, 1981.
10. A. GEORGE, J. LIU, AND E. NG, Communication results for parallel sparse Choleskyfactorization on a hypercu.be, Parallel Comput., 10 (1989), pp. 287-298.
11. J. GILBERT AND R. SCHREIBER, Highly parallel sparse Cholesky factorization, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 1184-1197.
12. J. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, 12 (1986), pp. 127-148.
13. R. LUCAS, Solving Planar Systems of Equations on Distributed-Memory Multiprocessors, Ph.D. thesis, Stanford University, Stanford, CA, 1988.
14. E. No AND B. PEYTON, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Comput., 14 (1993), pp. 1034-1056.
15. A. POTHEN AND C. SUN, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput., 14 (1986), pp. 1253-1257.
16. E. ROTHBERG AND A. GUPTA, An efficient block-oriented approach to parallel sparse Cholesky factorization, in Proc. Supercomputing '93, Portland, OR, November 1993, pp. 503-512.
17. _, An Evaluation of Left-Looking, Right-Looking, and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines, Tech. Report STAN-CS-91-1377, Stanford University, Stanford, CA, 1991.
18. E. ROTHBERG, Exploiting the Memory Hierarchy in Sequential and Parallel Sparse Cholesky Factorization, Ph.D. thesis, Stanford University, Stanford, CA, 1993.
19. E. ROTHBERG AND A. GUPTA, Techniques for improving the performance of sparse Cholesky factorization on multiprocessor workstations, in Proc. Supercomputing '90, New York, NY, November 1990, pp. 232-243.
20. H. SIMON, P. Vu, AND C. YANG, Performance of a Supernodal General Sparse Solver on the CRAY Y-MP: 1.68 Gflops with Autotasking, Tech. Report SCA-TR-117, Boeing Computer Services, Seattle, WA, 1989.
21. C, SUN, Efficient Parallel Solutions of Large Sparse SPD Systems on Distributed-Memory Multiprocessors, Cornell Theory Center Technical Report CTC92TR102, Cornell University, Ithaca, NY, 1992.