loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)
The Use of the Dynamic Space Decomposition Algorithm of a Computational Area in Heterogeneous Cluster Computations
Bialystok, Poland
September 13-September 17
ISBN: 0-7695-2554-7
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.

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.

Citation:
Wojciech Walendziuk, Slawomir Kwieckowski, "The Use of the Dynamic Space Decomposition Algorithm of a Computational Area in Heterogeneous Cluster Computations," parelec, pp.466-469, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.