A hierarchical partitioning strategy for an efficient parallelization of the multilevel fast multipole algorithm

Simple item page
buir.contributor.authorGürel, Levent
buir.contributor.authorErgül, Özgür
dc.citation.epage1750en_US
dc.citation.issueNumber6en_US
dc.citation.spage1740en_US
dc.citation.volumeNumber57en_US
dc.contributor.authorErgül, Özgüren_US
dc.contributor.authorGürel, Leventen_US
dc.date.accessioned2016-02-08T10:03:36Z
dc.date.available2016-02-08T10:03:36Z
dc.date.issued2009en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.departmentComputational Electromagnetics Research Center (BiLCEM)en_US
dc.description.abstractWe 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.en_US
dc.description.sponsorshipScientific and Technical Research Council of Turkey (TUBITAK)en_US
dc.description.sponsorshipASELSANen_US
dc.identifier.doi10.1109/TAP.2009.2019913en_US
dc.identifier.urihttp://hdl.handle.net/11693/22699
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TAP.2009.2019913en_US
dc.source.titleIEEE Transactions on Antennas and Propagationen_US
dc.subjectLarge-scale problemsen_US
dc.subjectMultilevel fast multipole algorithmen_US
dc.subjectParallelizationen_US
dc.subjectScattering problemsen_US
dc.subjectSurface integral equationsen_US
dc.titleA hierarchical partitioning strategy for an efficient parallelization of the multilevel fast multipole algorithmen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A hierarchical partitioning strategy for an efficient parallelization of the multilevel fast multipole algorithm.pdf
Size:
902.16 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Electrical and Electronics Engineering
Computational Electromagnetics Research Center (BiLCEM)