• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Advanced partitioning and communication strategies for the efficient parallelization of the multilevel fast multipole algorithm

      Thumbnail
      View / Download
      902.2 Kb
      Author
      Ergül O.
      Gürel, Levent
      Date
      2010
      Source Title
      2010 IEEE Antennas and Propagation Society International Symposium
      Publisher
      IEEE
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      133
      views
      42
      downloads
      Abstract
      Large-scale electromagnetics problems can be solved efficiently with the multilevel fast multipole algorithm (MLFMA) [1], which reduces the complexity of matrix-vector multiplications required by iterative solvers from O(N 2) to O(N logN). Parallelization of MLFMA on distributed-memory architectures enables fast and accurate solutions of radiation and scattering problems discretized with millions of unknowns using limited computational resources. Recently, we developed a hierarchical partitioning strategy [2], which provides an efficient parallelization of MLFMA, allowing for the solution of very large problems involving hundreds of millions of unknowns. In this strategy, both clusters (sub-domains) of the multilevel tree structure and their samples are partitioned among processors, which leads to improved load-balancing. We also show that communications between processors are reduced and the communication time is shortened, compared to previous parallelization strategies in the literature. On the other hand, improved partitioning of the tree structure complicates the arrangement of communications between processors. In this paper, we discuss communications in detail when MLFMA is parallelized using the hierarchical partitioning strategy. We present well-organized arrangements of communications in order to maximize the efficiency offered by the improved partitioning. We demonstrate the effectiveness of the resulting parallel implementation on a very large scattering problem involving a conducting sphere discretized with 375 million unknowns. ©2010 IEEE.
      Keywords
      Communication strategy
      Communication time
      Computational resources
      Conducting spheres
      Distributed memory
      Electromagnetics
      Hierarchical partitioning
      Iterative solvers
      Load-Balancing
      Matrix vector multiplication
      Multi-level fast multi-pole algorithm
      Multilevel fast multipole algorithms
      Parallel implementations
      Parallelization strategies
      Parallelizations
      Scattering problems
      Sub-domains
      Tree structures
      Antennas
      Spheres
      Trees (mathematics)
      Communication
      Permalink
      http://hdl.handle.net/11693/28508
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/APS.2010.5561775
      Collections
      • Computational Electromagnetics Research Center (BiLCEM) 85
      • Department of Electrical and Electronics Engineering 3601
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy