feasible implementation of these algorithms. The execution codes have been written in NESL, a parallel programming language developed at Carnegie Mellon University, and extensive experiments have been run on them. The goal of this project is to compare these three algorithms in terms of both the computational cost and the accuracy
We develop an algorithm that computes the gravitational potentials and forces on N point-masses int...
In this paper, we describe a new approximation algorithm for the n-body problem. The algorithm is a ...
Direct-summation N-body algorithms compute the gravitational interaction between stars in an exact w...
This work compares three algorithms for the three dimensional N-body problem, the Barnes-Hut algorit...
This work considers the organization and performance of computations on parallel computers of tree...
In this paper, we present two new parallel formulations of the Barnes-Hut method. These parallel for...
We describe the design of several portable and efficient parallel implementations of adaptive N-body...
The classical n-body problem in physics addresses the prediction of individual motions of a group of...
oped by 3 undergraduate students at McMas-ter University, demonstrates that computation-ally intensi...
General N-body problems are a set of problems in which an update to a single element in the system d...
O(N) algorithms for N-body simulations enable the simulation of particle systems with up to 100 mill...
The main performance bottleneck of gravitational N-body codes is the force calculation between two p...
We report on an efficient adaptive N-body method which we have recently designed and implemented. Th...
The N-body problem is a classical problem in computational physics. Suppose there are N bodies, inde...
We present an empirical study of the accuracy-cost tradeoffs of Anderson's method. The various param...
We develop an algorithm that computes the gravitational potentials and forces on N point-masses int...
In this paper, we describe a new approximation algorithm for the n-body problem. The algorithm is a ...
Direct-summation N-body algorithms compute the gravitational interaction between stars in an exact w...
This work compares three algorithms for the three dimensional N-body problem, the Barnes-Hut algorit...
This work considers the organization and performance of computations on parallel computers of tree...
In this paper, we present two new parallel formulations of the Barnes-Hut method. These parallel for...
We describe the design of several portable and efficient parallel implementations of adaptive N-body...
The classical n-body problem in physics addresses the prediction of individual motions of a group of...
oped by 3 undergraduate students at McMas-ter University, demonstrates that computation-ally intensi...
General N-body problems are a set of problems in which an update to a single element in the system d...
O(N) algorithms for N-body simulations enable the simulation of particle systems with up to 100 mill...
The main performance bottleneck of gravitational N-body codes is the force calculation between two p...
We report on an efficient adaptive N-body method which we have recently designed and implemented. Th...
The N-body problem is a classical problem in computational physics. Suppose there are N bodies, inde...
We present an empirical study of the accuracy-cost tradeoffs of Anderson's method. The various param...
We develop an algorithm that computes the gravitational potentials and forces on N point-masses int...
In this paper, we describe a new approximation algorithm for the n-body problem. The algorithm is a ...
Direct-summation N-body algorithms compute the gravitational interaction between stars in an exact w...