Decomposition of the Computation Area in the Parallel Implementation of the FDTD Algorithm.

Published in Volume XI, 2002, p. 180-192

Author(s): Wojciech WALENDZIUK, Jaroslaw FORENC

Abstract

In the following paper a two-dimensional parallel algorithm FDTD is presented. This algorithm uses a decomposition of a space domain into sub-areas. In addition, the shapes of the dielectrics are approximated with the groups of rectangles, which are described by coordinates. The paper also contains the results of the tests analysing the relation of the computation times to the communication times into two types of the connection topology of the computation nodes. The computations were made on a homogeneous cluster of personal computers.