Astrophysical N-body simulations using hierarchical tree data structures
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
A parallel hashed Oct-Tree N-body algorithm
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Journal of Parallel and Distributed Computing
A fast spherical filter with uniform resolution
Journal of Computational Physics
Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
SIAM Journal on Scientific Computing
Parallel Hierarchical Solvers and Preconditioners for Boundary Element Methods
SIAM Journal on Scientific Computing
Experiences with Parallel N-Body Simulation
IEEE Transactions on Parallel and Distributed Systems
Fast and Efficient Algorithms in Computational Electromagnetics
Fast and Efficient Algorithms in Computational Electromagnetics
The Accuracy of Fast Multipole Methods for Maxwell's Equations
IEEE Computational Science & Engineering
A Provably Optimal, Distribution-Independent Parallel Fast Multipole Method
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
A New Parallel Kernel-Independent Fast Multipole Method
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Low-constant parallel algorithms for finite element simulations using linear octrees
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
High performance BLAS formulation of the adaptive Fast Multipole Method
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
In this paper, we develop a parallel Fast Multipole Method (FMM) based solution for computing the scattered electromagnetic fields from a Perfect Electrically Conducting (PEC) surface. The main contributions of this work are the development of parallel algorithms with the following characteristics: 1) provably efficient worst-case run-time irrespective of the shape of the scatterer, 2) communication-efficiency, and 3) guaranteed load balancing within a small constant factor. We have developed a scalable, parallel code and validated it against surfaces for which solution can be computed analytically, and against serial software. The efficiency and scalability of the code is demonstrated with experimental results on an IBM xSeries cluster. Though developed in the context of this particular application, our algorithms can be used in other applications involving parallel FMM.