@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}
}

{"_id":"R2FCdtcrrp9wSTmXs","bibbaseid":"dubinski-aparalleltreecode","authorIDs":[],"author_short":["Dubinski, J."],"bibdata":{"bibtype":"article","type":"article","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 \\textbackslashtextgreater 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":[{"propositions":[],"lastnames":["Dubinski"],"firstnames":["John"],"suffixes":[]}],"file":"/home/dimitri/Nextcloud/Zotero/storage/XRS5U4LQ/Dubinski - 1996 - A parallel tree code.pdf","bibtex":"@article{dubinskiParallelTreeCode1996,\n title = {A Parallel Tree Code},\n volume = {1},\n issn = {13841076},\n doi = {10.1016/S1384-1076(96)00009-7},\n 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.},\n number = {2},\n journaltitle = {New Astronomy},\n date = {1996},\n pages = {133--147},\n keywords = {Cosmology: theory,Galaxies: formation,Galaxies: kinematics and dynamics,Methods: numerical},\n author = {Dubinski, John},\n file = {/home/dimitri/Nextcloud/Zotero/storage/XRS5U4LQ/Dubinski - 1996 - A parallel tree code.pdf}\n}\n\n","author_short":["Dubinski, J."],"key":"dubinskiParallelTreeCode1996","id":"dubinskiParallelTreeCode1996","bibbaseid":"dubinski-aparalleltreecode","role":"author","urls":{},"keyword":["Cosmology: theory","Galaxies: formation","Galaxies: kinematics and dynamics","Methods: numerical"],"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/dlozeve/newblog/master/bib/all.bib","creationDate":"2020-01-08T20:39:38.917Z","downloads":0,"keywords":["cosmology: theory","galaxies: formation","galaxies: kinematics and dynamics","methods: numerical"],"search_terms":["parallel","tree","code","dubinski"],"title":"A Parallel Tree Code","year":null,"dataSources":["3XqdvqRE7zuX4cm8m"]}