WIT Press


A Parallel Domain Decomposition Algorithm For Semiconductor Simulation

Price

Free (open access)

Volume

3

Pages

15

Published

1993

Size

1,197 kb

Paper DOI

10.2495/ASE930041

Copyright

WIT Press

Author(s)

C.H. Lai

Abstract

A parallel domain decomposition algorithm for semiconductor simulation C.-H. Lai Centre for Numerical Modelling and Processing Analysis, University of Greenwich, Wellington ABSTRACT A nonoverlapped domain decomposition algorithm is applied to a series of semiconductor devices. The physical domain of the devices is split into a number of nonoverlapped subdomains, yielding a family of independent sub- problems. An interface problem is formulated and a fixed point iteration technique is used to solve the discretised interface problem. The algorithm is implemented on a System 500 Matrix Coprocessor of the Floating Point Machine and the Coprocessor network described in this paper has a maximum configuration of twenty eight processors. INTRODUCTION Many of the numerical techniques used in the simulation of 2-D or 3-D semi- conductor devices are not suited to implementation on parallel computers. Divide- and-conquer algorithms have been demonstrated most suitable for such simulatio

Keywords