1:30 PM-3:30 PM
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
PP97 Homepage | Program Updates|
Registration | Hotel Information | Transportation | Program Overview | Program-at-a-Glance