A parallel FDTD algorithm using the MPI library

dc.contributor.authorVolakis J.L.
dc.contributor.authorDavidson D.B.
dc.contributor.authorGuiffaut C.
dc.contributor.authorMahdjoubi K.
dc.date.accessioned2011-05-15T15:59:16Z
dc.date.available2011-05-15T15:59:16Z
dc.date.issued2001
dc.description.abstractIn this paper, we describe the essential elements of a parallel algorithm for the FDTD method using the MPI (Message Passing Interface) library. To simplify and accelerate the algorithm, an MPI Cartesian 2D topology is used. The inter-process communications are optimized by the use of derived data types. A general approach is also explained for parallelizing the auxiliary tools, such as far-field computation, thin-wire treatment, etc. For PMLs, we have used a new method that makes it unnecessary to split the field components. This considerably simplifies the computer programming, and is compatible with the parallel algorithm.
dc.description.versionReview
dc.identifier.citationIEEE Antennas and Propagation Magazine
dc.identifier.citation43
dc.identifier.citation2
dc.identifier.issn10459243
dc.identifier.other10.1109/74.924608
dc.identifier.urihttp://hdl.handle.net/10019.1/11087
dc.subjectComputer programming
dc.subjectDigital libraries
dc.subjectFinite difference method
dc.subjectInterfaces (computer)
dc.subjectInter-processor communications
dc.subjectParallel algorithms
dc.titleA parallel FDTD algorithm using the MPI library
dc.typeReview
Files