Efficient tree codes on SIMD computer architectures

Details Efficient tree codes on SIMD computer architectures Efficient tree codes on SIMD computer architectures

Nov 1996

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1996cophc..98..267o&link_type=abstract

Computer Physics Communications, vol. 98, Issue 3, pp.267-287

Astronomy and Astrophysics

Astrophysics

Astronomy And Astrophysics, Stars And Stellar Systems, Computer Languages, Hardware And Software, Software Including Parallel Algorithms

Scientific paper

This paper describes changes made to a previous implementation of an N -body tree code developed for a fine-grained, SIMD computer architecture. These changes include (1) switching from a balanced binary tree to a balanced oct tree, (2) addition of quadrupole corrections, and (3) having the particles search the tree in groups rather than individually. An algorithm for limiting errors is also discussed. In aggregate, these changes have led to a performance increase of over a factor of 10 compared to the previous code. For problems several times larger than the processor array, the code now achieves performance levels of ~ 1 Gflop on the Maspar MP-2 or roughly 20% of the quoted peak performance of this machine. This percentage is competitive with other parallel implementations of tree codes on MIMD architectures. This is significant, considering the low relative cost of SIMD architectures.

Affiliated with

Also associated with

No associations

Rating

Efficient tree codes on SIMD computer architectures 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 Efficient tree codes on SIMD computer architectures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient tree codes on SIMD computer architectures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1146943