arXiv · astro-ph/9603097
A Parallel Tree Code
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
John Dubinski. 1996-03-18. A Parallel Tree Code. https://doi.org/10.1016/s1384-1076(96)00009-7
Cite the original work for its findings. Save a collection to share your selection of sources.