N-body Simulations on a Massively Parallel Computer

Astronomy and Astrophysics – Astronomy

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We report in this poster on progress toward an efficient algorithm for performing gravitational N-body simulations using tree data structures on a massively parallel computer architecture. We focus here on our implementation of such a tree code employing a binary tree on a Maspar MP-1 computer. The Maspar MP-1 consists of 16,384 processors, each with 64 Kbytes of memory for an aggregate of 1 Gbyte of core memory. We have run various simulations with this code ranging from simulations of interacting disk galaxies to the formation of structure in an expanding universe. We achieve speeds close to those obtained on similar problems using a Cray Y-MP. This is significant owing to the low relative cost of the Maspar MP-1. We discuss further optimizations to the basic algorithm and our progress toward achieving them. With a careful treatment of load balancing of work among the processors, we feel that speeds in excess of the fastest of today's vector supercomputers can be attained. Finally, we point out that the algorithm should scale with larger numbers of processors.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

N-body Simulations on a Massively Parallel Computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with N-body Simulations on a Massively Parallel Computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and N-body Simulations on a Massively Parallel Computer will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-777879

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.