A parallel iterative linear solver for solving irregular grid semiconductor device matrices

Authors:
E. Tomacruz;J. Sanghavi;A. Sangiovanni-Vincentelli
Affiliations:
University of California, Berkeley;University of California, Berkeley;University of California, Berkeley
Venue:
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Year:
1994

Citing 6
Cited 2

A Partitioning Strategy for Nonuniform Problems on Multiprocessors

IEEE Transactions on Computers
CGS, a fast Lanczos-type solver for nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
The effect of ordering on preconditioned conjugate gradients

BIT
PILS: an iterative linear solver package for ill-conditioned systems

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

Time-domain non-Monte Carlo noise simulation for nonlinear dynamic circuits with arbitrary excitations

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Parallel implementation of the diffusion-drift algorithm for modeling the electrophysiological activity of breast tumors

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the use of parallel processors for the solution of drift-diffusion semiconductor device equations using an irregular grid discretization. Preconditioning, partitioning, and communication scheduling algorithms are developed to implement an efficient and robust iterative linear solver with preconditioning. The parallel program is executed on a 64 node CM-5 and is compared with PILS running on a single processor. We observe an efficiency increase in obtaining parallel speed-ups as the problem size increases. We obtain 60% efficiency for CGS with no preconditioning for large problems. Using CGS with processor ILU and magnitude threshold fill-in preconditioning for the CM-5 and CGS with ILU for PILS, we attain 50% efficiency for the solution of the large matrices.