An Efficient Implementation of Parallel FDTD

Xiaohe Chen; Michael A. Cracraft; Yaojiang Zhang; Jianmin Zhang; James L. Drewniak; Bruce Archambeault; Samuel R. Connor

doi:10.1109/ISEMC.2007.197

An Efficient Implementation of Parallel FDTD

Xiaohe Chen
, Michael A. Cracraft
, Yaojiang Zhang
, Jianmin Zhang
, James L. Drewniak
, Bruce Archambeault
, Samuel R. Connor

Missouri University of Science and Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	American English
Journal	Proceedings of the IEEE International Symposium on Electromagnetic Compatibility (2007, Honolulu, HI)
DOIs	https://doi.org/10.1109/ISEMC.2007.197
State	Published - Jul 1 2007

Keywords

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

Disciplines

Electrical and Computer Engineering

Access to Document

10.1109/ISEMC.2007.197License: CC BY

An Efficient Implementation of Parallel FDTDFinal published version, 392 KBLicense: CC BY

Cite this

@article{235d126127274bf880267271ef077695,

title = "An Efficient Implementation of Parallel FDTD",

abstract = " 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.",

keywords = "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",

author = "Xiaohe Chen and Cracraft, \{Michael A.\} and Yaojiang Zhang and Jianmin Zhang and Drewniak, \{James L.\} and Bruce Archambeault and Connor, \{Samuel R.\}",

year = "2007",

month = jul,

day = "1",

doi = "10.1109/ISEMC.2007.197",

language = "American English",

journal = "Proceedings of the IEEE International Symposium on Electromagnetic Compatibility (2007, Honolulu, HI)",

}

TY - JOUR

T1 - An Efficient Implementation of Parallel FDTD

AU - Chen, Xiaohe

AU - Cracraft, Michael A.

AU - Zhang, Yaojiang

AU - Zhang, Jianmin

AU - Drewniak, James L.

AU - Archambeault, Bruce

AU - Connor, Samuel R.

PY - 2007/7/1

Y1 - 2007/7/1

N2 - 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.

AB - 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.

KW - Crosstalk

KW - Data Communication

KW - Finite Difference Time-Domain Analysis

KW - Integrated Circuit Packaging

KW - Message Passing

KW - Parallel Processing

KW - Cross Talks

KW - Data Communications

KW - Domain Decomposition

KW - Efficient Implementation

KW - IC Packaging

KW - International Symposium

KW - Message-Passing Interface

KW - Parallel Efficiency

KW - Parallel FDTD Algorithm

KW - Domain Decomposition Methods

KW - Electric Inverters

KW - Electromagnetism

KW - Finite Difference Time Domain Method

KW - Parallel Algorithms

KW - Plastic Molds

KW - Technical Presentations

KW - Electromagnetic Compatibility

UR - https://scholarsmine.mst.edu/ele_comeng_facwork/863

U2 - 10.1109/ISEMC.2007.197

DO - 10.1109/ISEMC.2007.197

M3 - Article

JO - Proceedings of the IEEE International Symposium on Electromagnetic Compatibility (2007, Honolulu, HI)

JF - Proceedings of the IEEE International Symposium on Electromagnetic Compatibility (2007, Honolulu, HI)

ER -

An Efficient Implementation of Parallel FDTD

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Fingerprint

Cite this