Departmental Papers (MEAM)

Document Type

Conference Paper

Date of this Version

November 2003

Comments

© ACM, 2003. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the ACM/IEEE SC2003 Conference November 15 - 21, 2003 Phoenix, Arizona.

NOTE: At the time of publication, author George Biros was affiliated with New York University. Currently (March 2005), he is a faculty member in the Department of Mechanical Engineering and Applied Mechanics at the University of Pennsylvania.

Abstract

We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions does not rely on any analytic expansions, but only utilizes kernel evaluations. The new method provides the enabling technology for many important problems in computational science and engineering. Examples include viscous flows, fracture mechanics and screened Coulombic interactions. Our MPI-based parallel implementation logically separates the computation and communication phases to avoid synchronization in the upward and downward computation passes, and thus allows us to fully exploit computation and communication overlapping. We measure isogranular and fixed-size scalability for a variety of kernels on the Pittsburgh Supercomputing Center's TCS-1 Alphaserver on up to 3000 processors. We have solved viscous flow problems with up to 2.1 billion unknowns and we have achieved 1.6 Tflops/s peak performance and 1.13 Tflops/s sustained performance.

Keywords

Fast multipole methods, adaptive algorithms, massively parallel computing, boundary integral

Share

COinS

Date Posted: 27 July 2004