A Parallel Tree Code
Astrophysics
2009-10-28 v1
Abstract
We describe a new implementation of a parallel N-body tree code. The code is load-balanced using the method of orthogonal recursive bisection to subdivide the N-body system into independent rectangular volumes each of which is mapped to a processor on a parallel computer. On the Cray T3D, the load balance in the range of 70-90\% depending on the problem size and number of processors. The code can handle simulations with 10 million particles roughly a factor of 10 greater than allowed in vectorized tree codes.
Cite
@article{arxiv.astro-ph/9603097,
title = {A Parallel Tree Code},
author = {John Dubinski},
journal= {arXiv preprint arXiv:astro-ph/9603097},
year = {2009}
}
Comments
19 pages with 8 postscript figures, aaspp4.sty or check http://www.ucolick.org/~dubinski/treecode/treecode.html