by Technische Hochschule, Wolfgang Fichtner, Olaf Schenk, Olaf Schenk, Klaus Gartner, Klaus Gartner
http://www.iis.ee.ethz.ch/~oschenk/papers/oschenk-ishpc-procee-1999.ps.gz
Add To MetaCart
Abstract:
We present PARDISO, a new scalable parallel sparse direct linear solver on shared memory multiprocessors. In this paper, we describe the parallel factorization algorithm which utilizes the supernode structure of the matrix to reduce the number of memory references with Level 3 BLAS. We also propose enhancements that significantly reduce the communication rate for pipelining parallelism. The result is a greatly increased factorization performance. Furthermore, we have investigated popular shared memory multiprocessors and the most popular numerical algorithms commonly used for the solution of the classical drift-diffusion and the diffusion-reaction equations in semiconductor device and process simulation. The study includes a preconditioned iterative linear solver package and our parallel direct linear solver. Moreover, we have investigated the efficiency and the limits of our parallel approach. Results of several simulations of up to 300'000 unknowns for three-dimensional simulations are presented to illustrate our approach towards robust, parallel semiconductor device and process simulation. 1
Citations
|
721
|
Iterative Methods for Sparse Linear Systems
– Saad
- 2003
|
|
237
|
Users' guide for the Harwell-Boeing sparse matrix collection (release I).Technical Report TR/PA/92/86, Research and Technology Division, Boeing Computer Services
– Duff, Grimes, et al.
- 1992
|
|
139
|
The role of elimination trees in sparse factorization
– Liu
- 1990
|
|
118
|
Modification of the minimum-degree algorithm by multiple elimination
– Liu
- 1985
|
|
39
|
Progress in sparse matrix methods for large linear systems on vector supercomputers
– Ashcraft, Grimes, et al.
- 1987
|
|
39
|
Exploiting the memory hierarchy in sequential and parallel sparse cholesky factorization
– Rothberg
- 1992
|
|
23
|
A supernodal Cholesky factorization algorithm for shared-memory multiprocessors
– Ng, Peyton
- 1993
|
|
18
|
Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
– Schenk, Gärtner, et al.
- 2000
|
|
16
|
BiCGstab(l) and other hybrid Bi-CG methods
– Sleijpen, Vorst, et al.
- 1994
|
|
15
|
An evaluation of left-looking, right-looking and multifrontal approaches to sparse Cholesky factorization on hierarchical-memory machines
– Rothberg, Gupta
- 1991
|
|
15
|
Parallel sparse QR factorization on shared memory architectures
– Matstoms
- 1995
|
|
9
|
Subspace methods for linear, nonlinear, and eigen problems
– Fokkema
- 1996
|
|
6
|
Three dimensional numerical semiconductor device simulation: Algorithms, architectures, results
– Heiser, Pommerell, et al.
- 1991
|
|
6
|
OpenMP: An Industry-Standard API for Shared-Memory Programming
– Dagnum, Menon
- 1998
|
|
4
|
Analysis of multilevel graph algorithms
– Karypis, Kumar
|
|
3
|
Efficient Solution of Large Sparse Linear Systems
– Liegmann
- 1995
|
