Xavier Martorell, Nils Smeds, et al.
IBM J. Res. Dev
Paper
Hierarchical decomposition: A parallel implementation of the Barnes-Hut tree algorithm
Abstract
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.
Related
Uwe Glässner, Gyan Bhanot, et al.
Nuclear Physics B (Proceedings Supplements)
Stephen L. Adler, Gyan Bhanot, et al.
IEEE Transactions on Neural Networks
Bronis R. de Supinski, Martin Schulz, et al.
International Journal of High Performance Computing Applications