An Efficient Implementation of Parallel FDTD
This document has been relocated to http://scholarsmine.mst.edu/ele_comeng_facwork/863
There were 18 downloads as of 27 Jun 2016.
A parallel FDTD algorithm has been realized based on 1-D domain decomposition. Data communication among different adjacent processors is manipulated by a self-defined C++ class ( MPI_FDTD) in which portable functions of the message passing interface (MPI) library are used. The details of the implementation are discussed. EMC applications of the code such as cross talk of traces, cavity, vias, as well as an IC package are provided to demonstrate the parallel efficiency.