Sciweavers

Share
SC
2003
ACM

A New Parallel Kernel-Independent Fast Multipole Method

9 years 11 months ago
A New Parallel Kernel-Independent Fast Multipole Method
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
Lexing Ying, George Biros, Denis Zorin, Harper Lan
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where SC
Authors Lexing Ying, George Biros, Denis Zorin, Harper Langston
Comments (0)
books