A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm
IEEE Transactions on Antennas and Propagation
1740 - 1750
MetadataShow full item record
Ergul, O., & Gurel, L. (2009). A hierarchical partitioning strategy for an efficient parallelization of the multilevel fast multipole algorithm. IEEE Transactions on antennas and propagation, 57(6), 1740.
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/11746
We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributed-memory architectures to solve large-scale problems in electromagnetics. Unlike previous parallelization techniques, the tree structure of MLFMA is distributed among processors by partitioning both clusters and samples of fields at each level. Due to the improved load-balancing, the hierarchical strategy offers a higher parallelization efficiency than previous approaches, especially when the number of processors is large. We demonstrate the improved efficiency on scattering problems discretized with millions of unknowns. In addition, we present the effectiveness of our algorithm by solving very large scattering problems involving a conducting sphere of radius 210 wavelengths and a complicated real-life target with a maximum dimension of 880 wavelengths. Both of the objects are discretized with more than 200 million unknowns.