Title :
A massively parallel algorithm for three-dimensional device simulation
Author :
Webber, Donald M. ; Tomacruz, Eric ; Guerrieri, Roberto ; Toyabe, Toru ; Sangiovanni-Vincentelli, Alberto
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
fDate :
9/1/1991 12:00:00 AM
Abstract :
Based on a CGS (conjugate gradient squared) iteration with a partitioned natural ordering, a novel massively parallel algorithm for three-dimensional device simulation is presented. This algorithm requires constant time per matrix iteration independent of the number of grid nodes, and has convergence properties comparable to those of good algorithms currently used on sequential computers. This algorithm has been implemented on the Connection Machine and achieves supercomputer performance for large numbers of grid nodes. Results are presented for a wide variety of devices and mesh sizes
Keywords :
electronic engineering computing; iterative methods; parallel algorithms; semiconductor device models; Connection Machine; conjugate gradient squared; convergence properties; massively parallel algorithm; matrix iteration; partitioned natural ordering; supercomputer performance; three-dimensional device simulation; Central Processing Unit; Computational efficiency; Computational modeling; Concurrent computing; Equations; Linear systems; Parallel algorithms; Semiconductor device modeling; Semiconductor devices; Sparse matrices;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
