By Topic

The Use of the Dynamic Space Decomposition Algorithm of a Computational Area in Heterogeneous Cluster Computations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Walendziuk, W. ; Bialystok Tech. Univ. ; Kwieckowski, S.

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. 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. 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

Published in:

Parallel Computing in Electrical Engineering, 2006. PAR ELEC 2006. International Symposium on

Date of Conference:

13-17 Sept. 2006