• DocumentCode
    2317886
  • Title

    An asynchronous parallel multilevel fast multipole algorithm

  • Author

    Fostier, Jan ; Olyslager, Femke

  • Author_Institution
    Ghent Univ., Ghent
  • fYear
    2007
  • fDate
    9-15 June 2007
  • Firstpage
    3424
  • Lastpage
    3427
  • Abstract
    The multilevel fast multipole algorithm (MLFMA) has gained substantial interest as a method to accelerate the matrix-vector product in the iterative solving of electromagnetic scattering problems. Its complexity of O(N) or 0(N log N) allows for the simulation of very large scale problems when sufficient computational resources such as parallel computers are available. However, the derivation of a parallel variant of the MLFMA is a non-trivial assignment due to the intense communication between the nodes required at each iterative step. This becomes especially true when considering distributed memory machines where the processors only have fast access to their own local memory. For communication, they rely on message passing through an interconnection network which speed determines to a great extent the parallel efficiency that can be obtained. Previous efforts at parallel MLFMA focused essentially on the scattering from a single three-dimensional perfect electric conductor (PEC) [1, 2]. In this contribution, we propose a novel asynchronous parallel algorithm. When considering parallel algorithms, the term asynchronous denotes that different processors can perform different types of operations at a given time, e.g. while some nodes are calculating, others could be communicating. This has two major advantages. First, by distributing communication in time, communication congestion is avoided and the need for a fast and hence expensive interconnection network is alleviated. This allows for parallel MLFMA on very low-cost non-dedicated parallel systems such as GRID computers or clusters of workstations. Second, the asynchronous algorithm allows for an efficient parallelization strategy when different dielectric objects are considered. This will be further explained in the next section. The parallel algorithm makes no assumptions about the kernel used or the dimensionality of the problem and is implemented on a method of moment discretization of a two-dimensional TM elect- romagnetic scattering problem.
  • Keywords
    computational complexity; computational electromagnetics; electromagnetic wave scattering; iterative methods; mathematics computing; matrix algebra; method of moments; parallel algorithms; vectors; asynchronous parallel algorithm; computational resources; distributed memory machine; electromagnetic scattering problems; interconnection network; iterative steps; large scale problems; matrix-vector product; message passing; method of moment discretization; multilevel fast multipole algorithm; two-dimensional TM electromagnetic scattering problem; Acceleration; Computational modeling; Computer simulation; Concurrent computing; Electromagnetic scattering; Iterative methods; Large-scale systems; MLFMA; Multiprocessor interconnection networks; Parallel algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Antennas and Propagation Society International Symposium, 2007 IEEE
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    978-1-4244-0877-1
  • Electronic_ISBN
    978-1-4244-0878-8
  • Type

    conf

  • DOI
    10.1109/APS.2007.4396273
  • Filename
    4396273