Scalable parallel sparse factorization with left-right looking strategy on shared memory multiprocessors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1593, Issue , 1999, Pages 221-230

  Schenk, Olaf ^a   Gärtner, Klaus ^b   Fichtner, Wolfgang ^a  

^a ETH ZURICH   (Switzerland)

^b WEIERSTRASS INSTITUTE FOR APPLIED ANALYSIS AND STOCHASTICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; MULTIPROCESSING SYSTEMS; SEMICONDUCTOR DEVICES;

COMMUNICATION OVERHEADS; INTERPROCESS COMMUNICATION; PARALLEL COMPUTER; SCHEDULING SCHEMES; SEMICONDUCTOR DEVICE SIMULATION; SHARED MEMORY MULTIPROCESSOR; SINGLE-NODE PERFORMANCE; STRUCTURAL ENGINEERING PROBLEMS;

MEMORY ARCHITECTURE;

EID: 84956861101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0100583     Document Type: Conference Paper

References (14)

1. C. ASHCRAFT, R. GRIMES, J. LEWIS, B. PEYTON, and U. SIMON, ProDress in sparse matrix methods for large linear systems on vector supercomputers, The International Journal of Supercomputer Applications, 1 (1987), pp. 10-30.
2. I. S. DUFF, Multiprocessing a sparse matrix code on the alliant fx/8, J. Comput. Appl. Math., 27 (1989), pp. 229-239.
3. D. FOKKEMA, Subspace methods for linear, nonlinear, and eigen problems., PAD thesis, Utrecht University, 1996.
4. INTEGRATED SYSTEMS ENGINEERING AG, DESSIS-IsE Reference Manual, ISE Integrated Systems Engineering AG, 1998.
5. DIOS-IsE Reference Manual, ISE Integrated Systems Engineering AG, 1998.
6. G. KARYPIS and V. KUMAR, Analysis of multilevel graph algorithms, Tech. Rep. MN 95 - 037, University of Minnesota, Department of Computer Science, Minneapolis, MN 55455, 1995.
7. A. LIEGMANN, Efficient Solution of Large Sparse Linear Systems, PAD thesis, ETH Zürich, 1995.
8. J. LIU, The role of elimination trees in sparse faetorization, SIAM Journal on Matrix Analysis & Applications, 11 (1990), pp. 134-172.
9. P. MATSTOMS, Parallel sparse QR factorization on shared memory architectures, Parallel Computing, 21 (1995), pp. 473-486.
10. E. Ng and B. PEYTON, A supernodal Cholesky factorization algorithm for shared-memory multiprocessors, SIAM Journal on Scientific Computing, 14 (1993), pp. 761-769.
11. E. ROTHBERG, Exploiting the memory hierarchy in sequential and parallel sparse Cholesky faetorization, PAD thesis, Stanford University, 1992. STAN-CS-92-1459.
12. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, 1996.
13. O. SCHENK, K. GÄRTNER, and W. FICHTNER, Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors, Tech. Rep. 98/40, Integrated Systems Laboratory, ETH Zurich, Swiss Fed. Inst. of Technology (ETH), Zurich, Switzerland, Submitted to BIT Numerical Mathematics, 1998.
14. G. SLEIJPEN, H. Van Der Vorst, and D. FOKKEMA, BiCGSTAB(1) and other hybrid Bi-CG methods, Tech. Rep. TR Nr. 831, Department of Mathematics, University Utrecht, 1993.