论文信息 - An N-body Tree Algorithm for the Cray T3D

An N-body Tree Algorithm for the Cray T3D

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.

Kevin M. Olson | Charles V. Packer

[1] 李幼升,et al. Ph , 1989 .

[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[3] Andrew W. Appel,et al. An Efficient Program for Many-Body Simulation , 1983 .

[4] Kevin Olson. Efficient tree codes on SIMD computer architectures , 1996 .

[5] John K. Salmon,et al. Parallel hierarchical N-body methods , 1992 .

[6] Joshua E. Barnes,et al. A modified tree code: don't laugh; it runs , 1990 .

[7] Thomas L. Sterling,et al. BEOWULF: A Parallel Workstation for Scientific Computation , 1995, ICPP.

[8] Jack Dongarra,et al. PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .

[9] Michael S. Warren,et al. Skeletons from the treecode closet , 1994 .

[10] L. Hernquist,et al. Vectorization of tree traversals , 1990 .

[11] J. Dorband,et al. An implementation of a tree code on a SIMD, parallel computer , 1994 .

[12] J. E. Dorband. Sort computation , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.

[13] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[14] Marios D. Dikaiakos,et al. A performance study of cosmological simulations on message-passing and shared-memory multiprocessors , 1996, ICS '96.

[15] David H. Porter,et al. A tree code with logarithmic reduction of force terms, hierarchical regularization of all variables, and explicit accuracy controls , 1989 .