Skip to main content
Log in

Parallel implementation of fast multipole method based on JASMIN

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Fast multipole method (FMM) may reduce the complexity of N-body problems from O(N 2) to O(N logN) or O(N). It was applied in problems ranging from electromagnetic scattering to dislocation dynamics. FMM can be divided into two parts: commonness and individuality. A parallel solver of FMM commonly used in various applications has been designed and implemented in JASMIN infrastructure. The solver encapsulates the commonness. Furthermore, it supplies users with abstract interfaces required to implement the individuality with serial mode. The commonness contains distributed storage of multi-levels, intra-level and inter-level data communication, and arrangement of computation, etc. The individuality contains various expansion and translation operators. We give here two applications that have used the solver. Scalability was demonstrated with a parallel efficiency above 80% on 1024 processors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Greengard L, Rokhlin V. A fast algorithm for particle simulations. J Comput Phys, 1987, 73: 325–348

    Article  MathSciNet  MATH  Google Scholar 

  2. Hu J, Nie Z P, Wang J. Multilevel fast multipole algorithm for solving scattering from 3-D electrically large object (in Chinese). Chin J Radio Sci, 2004, 19: 509–514

    Google Scholar 

  3. Pan X M, Sheng X Q. A highly efficient parallel approach of multi-level fast multipole algorithm (in Chinese). Chin J Electron, 2007, 35: 567–571

    Google Scholar 

  4. Arsenlis A, Cai W, Tang M, et al. Enabling strain hardening simulations with dislocation dynamics. Model Simul Mater Sci Eng, 2007, 15: 553–595

    Article  Google Scholar 

  5. Wang W, Feng Y D, Chi X B. Application of tree structure in N-body problem (in Chinese). Chin J Appl Res Comput, 2008, 25: 42–44

    Google Scholar 

  6. Dongarra J, Sullivan F. The top 10 algorithms. Comput Sci Eng, 2000, 2: 22–23

    Article  Google Scholar 

  7. Fostier J, Olyslager F. A provably scalable parallel multilevel fast multipole algorithm. Electron Lett, 2008, 44: 1111–1113

    Article  Google Scholar 

  8. Michael L H. A study of MLFMA for large-scale scattering problems. Ph.D thesis. Urbana-Champaign: University of Illinois at Urbana-Champaign, 2003. 1–10

  9. Velamparambil S, Chew W C. Analysis and performance of a distributed memory multilevel fast multipole algorithm. IEEE Trans Antenn Propag, 2005, 53: 2719–2727

    Article  Google Scholar 

  10. Yang W. The fast multipole method for 2D coulombic problems: analysis, implementation, and visualization. MS. Thesis. Colleage Park: University of Maryland, 2005. 36-42

    Google Scholar 

  11. Mo Z Y, Zhang A Q. User manual for JASMIN (in Chinese). IAPCM Technical Report T09-JMJL-01. 2008. 29–38

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to XiaoLin Cao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cao, X., Mo, Z., Liu, X. et al. Parallel implementation of fast multipole method based on JASMIN. Sci. China Inf. Sci. 54, 757–766 (2011). https://doi.org/10.1007/s11432-011-4181-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4181-3

Keywords

Navigation