Conference paper
Looking under the hood of the IBM blue gene/Q network
Dong Chen, Noel Eisley, et al.
SC 2012
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.
Dong Chen, Noel Eisley, et al.
SC 2012
Gabriela Alexe, Ramakrishna Ramaswamy, et al.
CSB 2005
Ravi Vijaya Satya, Amar Mukherjee, et al.
Bioinformatics
Pier Giorgio Raponi, Fabrizio Petrini, et al.
IPDPSW 2011