✦ LIBER ✦

Advantages of modal decomposition for efficient scaling of parallel FDTD computations

✍ Scribed by Dmitry A. Gorodetsky; Philip A. Wilsey

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 177 KB
Volume: 24
Category: Article
ISSN: 0894-3370
DOI: 10.1002/jnm.795

No coin nor oath required. For personal study only.

✦ Synopsis

When a scheme such as FDTD is used to perform full-wave electromagnetic simulation of electrically large objects, it can result in excessive computation times. Parallel processing is one means to reduce the computation time. A shortcoming of the parallel approach is the communication overhead that is responsible for reduced speedup efficiency but inevitable at every time step. An alternative to reduce the communication is to look at FDTD from the modal analysis point of view. With modal analysis we can gain some very useful insights into the operation of the algorithm, which we pay for with a relatively expensive setup time. We consider parallelizing the modal analysis algorithm with transient and steadystate excitation scenarios.

📜 SIMILAR VOLUMES

Parallel computing efficiency analysis o

Parallel computing efficiency analysis of BOR-FDTD code on a Beowulf cluster

✍ Yongquan Lu; Rui Lu; Qing Che; Zhiwu Su; Wenhua Yu; Raj Mittra 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB

## Abstract In this communication, we investigate the efficiency of a parallel BOR‐FDTD code on a commonly used Beowulf cluster which is connected via an Ethernet or Myrinet networking system. The efficiency of a parallel BOR‐FDTD code is relatively high since it only requires data exchanging betwe

Efficient parallel algorithms for the co

Efficient parallel algorithms for the computation of two-dimensional image moments

✍ Keping Chen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 770 KB

A direct Schur–Fourier decomposition for

A direct Schur–Fourier decomposition for the efficient solution of high-order Poisson equations on loosely coupled parallel computers

✍ F. X. Trias; M. Soria; C. D. Pérez-Segarra; A. Oliva 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

Parallelization of the Scale-Changing Te

Parallelization of the Scale-Changing Technique in Grid Computing environment for the electronmagnetic simulation of multi-scale structures

✍ F. Khalil; C. J. Barrios-Hernandez; A. Rashid; H. Aubert; Y. Denneulin; F. Cocce 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 564 KB

A parallel computing approach to run fast and full-wave electromagnetic simulation of complex structures in Grid Computing environment is presented. In this study, we show how Grid Computing improves speed and/or reliability over that provided by a single computer, while typically being much more co

Efficient Message Passing Interface (MPI

Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations

✍ Jehoshua Bruck; Danny Dolev; Ching-Tien Ho; Marcel-Cătălin Roşu; Ray Strong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 546 KB

Systematic and efficient root finder for

Systematic and efficient root finder for computing the modal spectrum of planar layered waveguides

✍ Raúl Rodríguez-Berral; Francisco Mesa; Francisco Medina 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

An efficient and systematic strategy to find the propagation constants of real, complex, and leaky modes of covered and uncovered planar multilayered isotropic/uniaxial waveguides is presented. This strategy first builds up a pole-free characteristic function and then makes use of a root-searching s