论文信息 - Investigating efficient parallelization techniques for the characteristic basis function method (CBFM)

Investigating efficient parallelization techniques for the characteristic basis function method (CBFM)

Two message-passing parallelization schemes for the Method of Moment (MoM) based Characteristic Basis Function Method (CBFM) are presented. The CBFM algorithm is implemented in the high-level scripting languages, Python and Octave and is parallelized using the Message Passing Interface (MPI) standard. The MPI implementations used for the parallelization, i.e. MPI for Python and MPI Toolbox for Octave and Matlab, are compared in terms of bandwidth, latency, speed-up and efficiency. The results are obtained from simulations conducted on an IBM e1350 Linux Cluster.

D. B. Davidson | D. J. Ludick

[1] A. Monorchio,et al. A Parallel Iteration-Free MoM Algorithm based on the Characteristic Basis Functions Method , 2007 .

[2] Hans-Hermann Frese,et al. Performance Evaluation of MPI and MPICH on the Cray T3E , 1999 .

[3] R. Mittra,et al. Characteristic basis function method: A new technique for efficient solution of method of moments matrix equations , 2003 .

[4] Raj Mittra,et al. Efficient analysis of a class of microstrip antennas using the characteristic basis function method (CBFM) , 2003 .

[5] Robert Michael Kirby,et al. Parallel Scientific Computing in C++ and MPI - A Seamless Approach to Parallel Algorithms and their Implementation , 2003 .

[6] Rolf Riesen,et al. Measuring MPI Latency Variance , 2003, PVM/MPI.

[7] D. Wilton,et al. Electromagnetic scattering by surfaces of arbitrary shape , 1980 .