Abstract
Computer simulation is a vital tool to today's advanced semiconductor device design and manufacturing. Unfortunately, precision requirements makes the shortest meaningful simulation run at least for hours on top of the line desktop workstations. To overcome this performance issue, we resort to parallel computers. In this paper, we describe the parallel linear solver based on LU decomposition that we introduce to solve the linear systems arising from the discretization of partial differential equations involved in semiconductor device simulation. This solver is now part of a software package called ATLAS that is widely distributed. Experiments are performed on the latest shared memory and distributed shared memory parallel computers, namely Sun Enterprise servers, Silicon Graphics Origin2000 and HP/Convex S-Class Exemplar.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Gita Alaghband. A parallel pivoting algorithm on a shared memory multiprocessor with controlled fill-in. In Proceedings of the 1988 International Conference on Parallel Processing, volume III, Algorithms and Applications, pages 177–180, University Park, Penn, August 1988. Penn State. U. Colorado, Denver.
Y. Apanovich, P. Blakey, R. Cottle, E. Lyumkis, B. Polsky, A. Shur, and A. Tcherniaev. Numerical simulation of submicrometer devices including coupled nonlocal transport and nonisothermal effects. IEEE Transactions on Electron Devices, pages 890–898, 1995.
Cleve Ashcraft, Stanley Eisenstat, and Joseph Lin. A fan-in algorithm for distributed sparse numerical factorization. Siam Journal of Scientific and Statistical Computations, pages 593–599, 1990.
J. J. Buoni, P. A. Farrell, and A. Ruttan. Algorithms for LU decomposition on a shared memory multiprocessor. Parallel Computing, 19(8):925–937, August 1993.
J.W.H. Liu. Equivalent sparse matrix reordering by elimination tree rotations. Siam journal of scientific and statistical computing, pages 424–445, 1988.
J.W.H. Liu. Reordering sparse matrices for parallel elimination. Parallel computing, pages 73–91, 1989.
J.W.H. Liu. The role of elimination trees in sparse factorization. Siam journal of matrix analysis applications, pages 134–172, 1990.
S. Selberherr. Analysis and Simulation of Semiconductor Devices. Springer Verlag, 1981.
A. van der Stappen, R. H. Bisseling, and J. G. G. van der Vorst. Parallel sparse LU decomposition on a mesh network of transputers. SIAM Journal on Matrix Analysis and Application, 14:853–879, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hahad, M. (1997). A parallel sparse LU decomposition with application to semiconductor device simulation. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002824
Download citation
DOI: https://doi.org/10.1007/BFb0002824
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive