Massively parallel device simulation using irregular grids

Partitioning, communication scheduling, and preconditioning algorithms are developed to implement a parallel linear solver for an irregular grid drift-diffusion device simulator. The parallel program is executed on a 64 node CM-5 and is compared with PILS running on a single processor. We obtain an average CPU time speed-up of 46.1X for each CGS iteration with no preconditioning, and a speed-up of 33.6X for the solution of the matrix.<<ETX>>

[1]  Wolfgang Fichtner,et al.  PILS: an iterative linear solver package for ill-conditioned systems , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[2]  Gernot Heiser,et al.  Three-dimensional numerical semiconductor device simulation: algorithms, architectures, results , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Robert W. Dutton,et al.  A STRIDE towards practical 3-D device simulation-numerical and visualization considerations , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  J. Palmer,et al.  Connection Machine model CM-5 system overview , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[5]  Alberto L. Sangiovanni-Vincentelli,et al.  A massively parallel algorithm for three-dimensional device simulation , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .