Stéphane Ethier, William M. Tang, et al.
IBM J. Res. Dev
Given the coordinates of N points in D dimensions, the Barnes-Hut tree algorithm produces an ordered list so that successive pairs in the sequence are nearest neighbors, sets of four form a cluster, sets of eight form a bigger cluster, and so on. We describe a parallel implementation of this algorithm on the IBM SP2 using Fortran 77 and MPI message-passing calls, and study its performance.
Stéphane Ethier, William M. Tang, et al.
IBM J. Res. Dev
Farid F. Abraham, Robert Walkup, et al.
PNAS
Gyan Bhanot, Dong Chen, et al.
Nuclear Physics B - Proceedings Supplements
John Michalakes, Josh Hacker, et al.
ACM/IEEE SC 2007