Application of parallel sparse direct methods in semiconductor device and process simulation
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.
Unable to display preview. Download preview PDF.
- 1.Integrated Systems Engineering AG. DESSIS-ise Reference Manual. ISE Integrated Systems Engineering AG, 1998.Google Scholar
- 2.Integrated Systems Engineering AG. DIOS-ise Reference Manual. ISE Integrated Systems Engineering AG, 1998.Google Scholar
- 5.G. Karypis and V. Kumar: Analysis of multilevel graph algorithms. Technical Report MN 95-037, University of Minnesota, Department of Computer Science, Minneapolis, MN 55455, 1995.Google Scholar
- 8.E. Rothberg. Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization. PhD thesis, Stanford University, 1992. STAN-CS-92-1459.Google Scholar
- 10.Integrated Systems Engineering AG. SUPER-ise reference Manual. ISE Integrated Systems Engineering AG, 1998.Google Scholar
- 11.I.S. Duff, R.G. Grimes, and J.G. Lewis. Users' guide for the Harwell-Boeing sparse matrix collection (release 1). Technical Report RAL-92-086, Rutherford Appleton Laboratory, 1992.Google Scholar
- 12.A. Liegmann. Efficient Solution of Large Sparse Linear Systems. PhD thesis, ETH Zürich, 1995.Google Scholar
- 15.R. Menon L. Dagnum. Open MP: An Industry-Standard API for Shared-Memory Programming. IEEE Computational Science & Engineering, 1:46–55, 1998.Google Scholar
- 16.O. Schenk, K. Gärtner, and W. Fichtner. Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors. Technical Report 98/40, Integrated Systems Laboratory, ETH Zurich, Swiss Fed. Inst. of Technology (ETH), Zurich, Switzerland, Submitted to BIT Numerical Mathematics, 1998.Google Scholar
- 17.Y. Saad. Iterative Methods for Sparse Linear Systems. PWS Publishing Company, 1996.Google Scholar
- 18.G.L.G. Sleijpen, H.A. van der Vorst, and D.R. Fokkema. BiCGSTAB(I) and other hybrid Bi-CG methods. Technical Report TR Nr. 831, Department of Mathematics, University Utrecht, 1993.Google Scholar
- 19.D.R. Fokkema. Subspace methods for linear, nonlinear, and eigen problems. PhD thesis, Utrecht University, 1996.Google Scholar