Brief announcement: Towards a communication optimal Fast Multipole Method and its implications at exascale

Aparna Chandramowlishwaran, Jee Whan Choi, Kamesh Madduri, Richard Vuduc

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

This paper presents the first in-depth models for compute and memory costs of the kernel-independent Fast Multipole Method (KIFMM). The Fast Multiple Method (FMM) has asymptotically linear time complexity with a guaranteed approximation accuracy, making it an attractive candidate for a wide variety of particle system simulations on future exascale systems. This paper reports on three key advances. First, we present lower bounds on cache complexity for key phases of the FMM and use these bounds to derive analytical performance models. Secondly, using these models, we present results for choosing the optimal algorithmic tuning parameter. Lastly, we use these performance models to make predictions about FMM's scalability on possible exascale system configurations, based on current technology trends. Looking forward to exascale, we suggest that the FMM, though highly compute-bound on today's systems, could in fact become memory-bound by 2020. Copyright is held by the author/owner(s).

Original languageEnglish (US)
Title of host publicationSPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures
Pages182-184
Number of pages3
DOIs
Publication statusPublished - Jul 27 2012
Event24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12 - Pittsburgh, PA, United States
Duration: Jun 25 2012Jun 27 2012

Other

Other24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12
CountryUnited States
CityPittsburgh, PA
Period6/25/126/27/12

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Cite this

Chandramowlishwaran, A., Choi, J. W., Madduri, K., & Vuduc, R. (2012). Brief announcement: Towards a communication optimal Fast Multipole Method and its implications at exascale. In SPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 182-184) https://doi.org/10.1145/2312005.2312039