The simulation of N-body system has been used extensively in biophysics and chemistry to investigate the dynamics of biomolecules and in astrophysics to study the chaotic characteristics of the galactic system. However, the longrange force calculation has a time complexity of O(N 2 ) where N is the number of particles in the system. The fast multipole algorithm (FMA), proposed by Greengard and Rokhlin, reduces the time complexity to O(N). Our goal is to build a parallel FMA library which is portable, scalable, and efficient. We use Message Passing Interface as the communication back-end. Also, an effective communication scheme to reduce communication overhead and a partitioning technique to obtain good load balancingamong processors were...
Multipole-based algorithms allow for reduction in the effort required to solve the N - body problem ...
We present an ecient and provably good partitioning and load balancing algorithm for parallel adapti...
This thesis presents a top to bottom analysis on designing and implementing fast algorithms for curr...
Given an ensemble of n bodies in space whose interaction is governed by a potential function, the N-...
We describe the design of several portable and efficient parallel implementations of adaptive N-body...
Many physical models require the simulation of a large number ($N$) of particles interacting throug...
N-Body simulation simulates the evolution of a system that is composed of N particles, where each el...
We present new analysis, algorithmic techniques, and implementations of the Fast Multipole Method (F...
This article introduces a novel approach to increase the performances of N-body simulations. In an N...
The fast multiple algorithm (FMA), used to compute interactions between M bodies, can be used effect...
AbstractThis paper presents a parallel version of the fast multipole method (FMM). The FMM is a rece...
We present parallel versions of a representative N-body application that uses Greengard and Rokhlin&...
Key issue of the project was to generate a computer code (MEGADYN) for the simulation of molecular d...
<b>Invited Lecture at the SIAM <i>"Encuentro Nacional de Ingeniería Matemática,"</i> at Pontificia U...
Solving an N-body problem, electrostatic or gravitational, is a crucial task and the main computatio...
Multipole-based algorithms allow for reduction in the effort required to solve the N - body problem ...
We present an ecient and provably good partitioning and load balancing algorithm for parallel adapti...
This thesis presents a top to bottom analysis on designing and implementing fast algorithms for curr...
Given an ensemble of n bodies in space whose interaction is governed by a potential function, the N-...
We describe the design of several portable and efficient parallel implementations of adaptive N-body...
Many physical models require the simulation of a large number ($N$) of particles interacting throug...
N-Body simulation simulates the evolution of a system that is composed of N particles, where each el...
We present new analysis, algorithmic techniques, and implementations of the Fast Multipole Method (F...
This article introduces a novel approach to increase the performances of N-body simulations. In an N...
The fast multiple algorithm (FMA), used to compute interactions between M bodies, can be used effect...
AbstractThis paper presents a parallel version of the fast multipole method (FMM). The FMM is a rece...
We present parallel versions of a representative N-body application that uses Greengard and Rokhlin&...
Key issue of the project was to generate a computer code (MEGADYN) for the simulation of molecular d...
<b>Invited Lecture at the SIAM <i>"Encuentro Nacional de Ingeniería Matemática,"</i> at Pontificia U...
Solving an N-body problem, electrostatic or gravitational, is a crucial task and the main computatio...
Multipole-based algorithms allow for reduction in the effort required to solve the N - body problem ...
We present an ecient and provably good partitioning and load balancing algorithm for parallel adapti...
This thesis presents a top to bottom analysis on designing and implementing fast algorithms for curr...