Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient parallel PML algorithms for truncating finite difference time domain simulations

Efficient parallel PML algorithms for truncating finite difference time domain simulations In this paper, the parallel implementation of the stretched coordinate perfectly matched layer (SC-PML) and the wave equation PML (WE-PML) formulations is presented for truncating three-dimensional (3-D) finite difference time domain (FDTD) grids. In the proposed parallel algorithms, the FDTD computational domain is divided into contiguous non-overlapping subdomains using two-dimensional topology and the interprocessor communications between the neighboring subdomains are carried out by using the message passing interface (MPI) system. The performance of the proposed parallel algorithms has been studied by using a point source radiating in 3-D domains and performed on a network of PCs interconnected with Ethernet. It has been observed that the WE-PML parallel algorithm is approximately 2.3 faster than the SC-PML parallel algorithm. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Electrical Engineering (Archiv fur Elektrotechnik) Springer Journals

Efficient parallel PML algorithms for truncating finite difference time domain simulations

Loading next page...
 
/lp/springer-journals/efficient-parallel-pml-algorithms-for-truncating-finite-difference-gfqAPgc0UW

References (16)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer-Verlag
Subject
Engineering; Energy Economics; Electrical Power Generation and Transmission; Electronic and Computer Engineering
ISSN
0948-7921
eISSN
1432-0487
DOI
10.1007/s00202-007-0070-6
Publisher site
See Article on Publisher Site

Abstract

In this paper, the parallel implementation of the stretched coordinate perfectly matched layer (SC-PML) and the wave equation PML (WE-PML) formulations is presented for truncating three-dimensional (3-D) finite difference time domain (FDTD) grids. In the proposed parallel algorithms, the FDTD computational domain is divided into contiguous non-overlapping subdomains using two-dimensional topology and the interprocessor communications between the neighboring subdomains are carried out by using the message passing interface (MPI) system. The performance of the proposed parallel algorithms has been studied by using a point source radiating in 3-D domains and performed on a network of PCs interconnected with Ethernet. It has been observed that the WE-PML parallel algorithm is approximately 2.3 faster than the SC-PML parallel algorithm.

Journal

Electrical Engineering (Archiv fur Elektrotechnik)Springer Journals

Published: Feb 1, 2008

There are no references for this article.