The need to run large, compute-bound programs encountered in research, coupled with the high availability of mini-and microcomputers in the laboratory environment, has prompted the linking of independent processors to form multicomputer systems. Important characteristics of the system presented here
Parallel FDTD simulator for MIMD computers
✍ Scribed by U. Effing; W. Kümpel; I. Wolff
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 327 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0894-3370
No coin nor oath required. For personal study only.
✦ Synopsis
A parallel implementation of the finite difference time-domain algorithm for the analysis of planar microwave circuits is presented in this paper. For this the FDTD mesh is divided in equal-sized subspaces. Every processor of the parallel computer calculates the field in one subspace. Furthermore detailed efficiency investigations are made to predict the timing performance of the parallel FDTD simulator.
📜 SIMILAR VOLUMES
A portable parallelization of the Cooley-Tukey FFT algorithm for MIMD multiprocessors is presented. The implementation uses the virtual machine for multiprocessors (VMMP) and PVM portable software packages. Since VMMP provides the same set of services on all target machines, a single version of the
Efficient programming of task-parallel problems, where the number and execution times of the computational tasks can vary unpredictably, demands an asynchronous and adaptive approach. In this sort of approach, however, such fundamental programming issues as load sharing, data sharing, and terminatio
Algorithm 1 (Compiling Align directives) Input: Fortran 90D/HPF syntax tree with some alignment functions to template Output: Fortran 90D/HPF syntax tree with identical alignment functions to template Method: For each aligned array, and for each dimension of that array, carry out the following ste
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 i