The Use of the Dynamic Space Decomposition Algorithm of a Computational Area in Heterogeneous Cluster Computations
Parallel Computing in Electrical Engineering, 2004. International Conference on (2006)
Sept. 13, 2006 to Sept. 17, 2006
Wojciech Walendziuk , Bialystok Technical University, Poland
Slawomir Kwieckowski , Bialystok Technical University, Poland
This article presents an algorithm of the dynamic space decomposition being used in parallel methods of numerical simulations. This algorithm decomposes a numerical model defined by a rectangular grid of material data into subareas. These subareas are then assigned to particular computational nodes of a heterogeneous cluster system during initialisation of the computational process. <p>The present work contains an example use of the algorithm applied to decompose the computational area in parallel implementation of the FDTD (Finite- Difference Time-Domain) method.</p> <p>The final part of the article contains the analysis of the decomposing algorithm in the form of the achieved speedup results of the parallel programme for various densities of the finite differences grid.</p>
W. Walendziuk and S. Kwieckowski, "The Use of the Dynamic Space Decomposition Algorithm of a Computational Area in Heterogeneous Cluster Computations," International Symposium on Parallel Computing in Electrical Engineering(PARELEC), Bialystok, 2006, pp. 466-469.