Astronomy and Astrophysics – Astrophysics
Scientific paper
May 1996
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1996gmu..rept.....o&link_type=abstract
Technical Report, George Mason Univ. Fairfax, VA United States
Astronomy and Astrophysics
Astrophysics
Many Body Problem, Algorithms, Parallel Computers, Architecture (Computers), Parallel Processing (Computers), Gravitation, Supercomputers, Astrophysics, Particle Mass, Data Structures, Grain Size, Trees (Mathematics), Time Dependence, Coarseness
Scientific paper
We describe in this paper an algorithm for solving the gravitational N-body problem using tree data structures on the Cray T3D parallel supercomputer. This implementation is an adaptation of previous work where this problem was solved using an SIMD, fine-grained parallel computer. We show here that this approach lends itself, with small modifications, to more coarse-grained parallelism as well. We also show that the performance of the algorithm on the Cray T3D parallel architecture scales adequately with the number of processors (up to 256). Specific levels to be reached using the Cray T3D parallel architecture. A peak performance level of 9.6 Gflop/s is reached on 256 processors for the time critical gravity computation.
Olson Kevin M.
Packer Charles V.
No associations
LandOfFree
An N-body Tree Algorithm for the Cray T3D 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 An N-body Tree Algorithm for the Cray T3D, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An N-body Tree Algorithm for the Cray T3D will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1358536