HIERARCHICAL DECOMPOSITION - A PARALLEL IMPLEMENTATION OF THE BARNES-HUT TREE ALGORITHM

Authors
BHANOT G JANAK J WALKUP R SONNAD V
Citation
G. Bhanot et al., HIERARCHICAL DECOMPOSITION - A PARALLEL IMPLEMENTATION OF THE BARNES-HUT TREE ALGORITHM, International journal of high speed computing, 8(1), 1996, pp. 1-12
Citations number
5
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
International journal of high speed computing → ACNP
ISSN journal
01290533
Volume
8
Issue
1
Year of publication
1996
Pages
1 - 12
Database
ISI
SICI code
0129-0533(1996)8:1<1:HD-API>2.0.ZU;2-R
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 se quence are nearest neighbors, sets of four form a cluster, sets of eig ht form a bigger cluster, and so on. We describe a parallel implementa tion of this algorithm on the IBM SP2 using Fortran 77 and MPI message -passing calls, and study its performance.