A Parallel Tree Code. Dubinski, J. 1(2):133–147.
doi  abstract   bibtex   
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 is in the range of 70-90% depending on the problem size and number of processors. The code can handle simulations with \textbackslashtextgreater 10 million particles, roughly a factor of 10 greater than allowed on vectorized tree codes.
@article{dubinskiParallelTreeCode1996,
  title = {A Parallel Tree Code},
  volume = {1},
  issn = {13841076},
  doi = {10.1016/S1384-1076(96)00009-7},
  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 is in the range of 70-90\% depending on the problem size and number of processors. The code can handle simulations with \textbackslash{}textgreater 10 million particles, roughly a factor of 10 greater than allowed on vectorized tree codes.},
  number = {2},
  journaltitle = {New Astronomy},
  date = {1996},
  pages = {133--147},
  keywords = {Cosmology: theory,Galaxies: formation,Galaxies: kinematics and dynamics,Methods: numerical},
  author = {Dubinski, John},
  file = {/home/dimitri/Nextcloud/Zotero/storage/XRS5U4LQ/Dubinski - 1996 - A parallel tree code.pdf}
}
Downloads: 0