Computer Science – Performance
Scientific paper
Jun 1989
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1989cophr...9..201m&link_type=abstract
Comput. Phys. Rep., Vol. 9, No. 4, p. 201 - 246
Computer Science
Performance
N-Body Problem: Computer Simulations, N-Body Problem: Stellar Systems
Scientific paper
The author evaluates the performance of the Connection Machine, a highly parallel computer with 65,536 processors and a peak speed of 10 Gflops, on several types of gravitational N-body simulations. He compares the results with similar tests on a variety of more traditional supercomputers. For either type of computer, the most efficient algorithm for simulating an arbitrary, very large system of self-gravitating particles, such as star clusters or galaxies, has a force calculation pattern based on a tree structure. This tree structure is highly irregular and rapidly changing in time. This algorithm therefore presents an extreme challenge for hardware as well as software of fast computers. The author presents benchmarks for this algorithm and also for a much simpler algorithm, together with a detailed analysis of the factors which determine the efficiency.
No associations
LandOfFree
Gravitational N-body algorithms. A comparison between supercomputers and a highly 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 Gravitational N-body algorithms. A comparison between supercomputers and a highly parallel computer., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gravitational N-body algorithms. A comparison between supercomputers and a highly parallel computer. will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1853439