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.
X. Chen et al., "An Efficient Implementation of Parallel FDTD," Proceedings of the IEEE International Symposium on Electromagnetic Compatibility (2007, Honolulu, HI), Institute of Electrical and Electronics Engineers (IEEE), Jul 2007.
The definitive version is available at https://doi.org/10.1109/ISEMC.2007.197
IEEE International Symposium on Electromagnetic Compatibility (2007: Jul. 9-13, Honolulu, HI)
Electrical and Computer Engineering
Keywords and Phrases
Crosstalk; Data Communication; Finite Difference Time-Domain Analysis; Integrated Circuit Packaging; Message Passing; Parallel Processing; Cross Talks; Data Communications; Domain Decomposition; Efficient Implementation; IC Packaging; International Symposium; Message-Passing Interface; Parallel Efficiency; Parallel FDTD Algorithm; Domain Decomposition Methods; Electric Inverters; Electromagnetism; Finite Difference Time Domain Method; Parallel Algorithms; Plastic Molds; Technical Presentations; Electromagnetic Compatibility
International Standard Book Number (ISBN)
International Standard Serial Number (ISSN)
Article - Conference proceedings
© 2007 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.