Friday, March 14

1:30 PM-3:30 PM
Nicollet D3

Parallel N-body Solvers

The N-body calculation consumes vast amounts of computer resources in important applications like molecular dynamics, astrophysics, materials science, electromagnetics, and fluid flow. In the past decade there has been exciting progress on this problem. Remarkably faster algorithms and software have been developed for computing pairwise interactions among large numbers of particles, typically subject to forces obeying an inverse square law. At least two important categories of algorithms have emerged: tree algorithms that divide the domain into cells and represent their far fields by (for example) multipole expansions, and grid algorithms that represent the distant interactions by piecewise polynomials. The purpose of this minisymposium is to present the latest information on the design and performance of parallel algorithms and software for the N-body problem.

Organizer: Robert D. Skeel
University of Illinois, Urbana-Champaign

1:30 Ewald and Multipole Methods for Periodic N-Body Problems
John A. Board, Jr., Christophe W. Humphres, Christophe G. Lambert, William T. Rankin, and Abdulnour Y. Toukmaji, Duke University
2:00 Particle-Mesh Based Methods for Fast Ewald Summation in Molecular Dynamics Simulations
Thomas A. Darden, National Institute of Environmental Health Sciences, Lee Pedersen, University of South Carolina, Chapel Hill, Abdulnour Toukmaji, Duke University, and Mike Crowley, Pittsburgh Supercomputing Center
2:30 Parallel, Out-of-Core Methods for Fast Evaluation of Long-Range Interactions
John Salmon, California Institute of Technology, and Michael S. Warren, Los Alamos National Laboratory
3:00 A Data-Parallel Adaptive N-Body Method
Y. Charlie Hu, Harvard University, S. Lennart Johnsson, University of Houston and Harvard University, and Shanghua Teng, University of Minnesota, Minneapolis

PP97 Homepage | Program Updates|
Registration | Hotel Information | Transportation | Program Overview | Program-at-a-Glance

MMD, 2/13/97