{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:46:14Z","timestamp":1783035974149,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011030","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0010295"],"award-info":[{"award-number":["DE-SC0010295"]}],"id":[{"id":"10.13039\/100011030","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-1550234 and OAC-1550525"],"award-info":[{"award-number":["OAC-1550234 and OAC-1550525"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,26]]},"DOI":"10.1145\/3330345.3330348","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"24-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient GPU tree walks for effective distributed n-body simulations"],"prefix":"10.1145","author":[{"given":"Jianqiao","family":"Liu","sequence":"first","affiliation":[{"name":"Purdue University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Robson","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Quinn","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milind","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Purdue University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"J. Barnes and P. Hut. 1986. A hierarchical O(N log N) force-calculation algorithm. nature 324 (1986) 4.  J. Barnes and P. Hut. 1986. A hierarchical O(N log N) force-calculation algorithm. nature 324 (1986) 4.","DOI":"10.1038\/324446a0"},{"key":"e_1_3_2_1_2_1","volume-title":"GPU Computing Gems Emerald Edition","author":"Burtscher Martin","unstructured":"Martin Burtscher and Keshav Pingali . 2011. An Efficient CUDA Implementation of the Tree-based Barnes Hut n-Body Algorithm . In GPU Computing Gems Emerald Edition . Elsevier Inc ., 75--92. Martin Burtscher and Keshav Pingali. 2011. An Efficient CUDA Implementation of the Tree-based Barnes Hut n-Body Algorithm. In GPU Computing Gems Emerald Edition. Elsevier Inc., 75--92."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588768.2576787"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.2002.7026"},{"key":"e_1_3_2_1_5_1","volume-title":"International Conference on Machine Learning. 172--180","author":"Gieseke Fabian","year":"2014","unstructured":"Fabian Gieseke , Justin Heinermann , Cosmin Oancea , and Christian Igel . 2014 . Buffer kd trees: processing massive nearest neighbor queries on GPUs . In International Conference on Machine Learning. 172--180 . Fabian Gieseke, Justin Heinermann, Cosmin Oancea, and Christian Igel. 2014. Buffer kd trees: processing massive nearest neighbor queries on GPUs. In International Conference on Machine Learning. 172--180."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503223"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079095"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 2010 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC '10)","author":"Jetley Pritish","unstructured":"Pritish Jetley , Lukasz Wesolowski , Filippo Gioachin , Laxmikant V. Kal\u00e9 , and Thomas R. Quinn . 2010. Scaling Hierarchical N-body Simulations on GPU Clusters . In Proceedings of the 2010 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC '10) . IEEE Computer Society, Washington, DC, USA, 1--11. Pritish Jetley, Lukasz Wesolowski, Filippo Gioachin, Laxmikant V. Kal\u00e9, and Thomas R. Quinn. 2010. Scaling Hierarchical N-body Simulations on GPU Clusters. In Proceedings of the 2010 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC '10). IEEE Computer Society, Washington, DC, USA, 1--11."},{"key":"e_1_3_2_1_9_1","volume-title":"Parallel science and engineering applications: The Charm++ approach","author":"Kale Laxmikant V","unstructured":"Laxmikant V Kale and Abhinav Bhatele . 2016. Parallel science and engineering applications: The Charm++ approach . CRC Press . Laxmikant V Kale and Abhinav Bhatele. 2016. Parallel science and engineering applications: The Charm++ approach. CRC Press."},{"key":"e_1_3_2_1_10_1","volume-title":"Parallel Programming using C++","author":"Kale L. V.","unstructured":"L. V. Kale and Sanjeev Krishnan . 1996. Charm++ : Parallel Programming with Message-Driven Objects . In Parallel Programming using C++ , Gregory V. Wilson and Paul Lu (Eds.). MIT Press , 175--213. L. V. Kale and Sanjeev Krishnan. 1996. Charm++: Parallel Programming with Message-Driven Objects. In Parallel Programming using C++, Gregory V. Wilson and Paul Lu (Eds.). MIT Press, 175--213."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3019094.3019102"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654118"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926261"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40668-015-0007-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597652.2597659"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413379"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"D. Potter J. Stadel and R. Teyssier. 2017. PKDGRAV3: beyond trillion particle cosmological simulations for the next era of galaxy surveys. Computational Astrophysics and Cosmology 4 Article 2 (May 2017) 2 pages. arXiv:astro-ph.IM\/1609.08621  D. Potter J. Stadel and R. Teyssier. 2017. PKDGRAV3: beyond trillion particle cosmological simulations for the next era of galaxy surveys. Computational Astrophysics and Cosmology 4 Article 2 (May 2017) 2 pages. arXiv:astro-ph.IM\/1609.08621","DOI":"10.1186\/s40668-017-0021-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1046\/j.1365-8711.2003.05925.x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"D. Reed J. Gardner T. Quinn J. Stadel M. Fardal G. Lake and F. Governato. 2003. Evolution of the mass function of dark matter haloes. MNRAS 346 (Dec. 2003) 565--572. arXiv:astro-ph\/0301270  D. Reed J. Gardner T. Quinn J. Stadel M. Fardal G. Lake and F. Governato. 2003. Evolution of the mass function of dark matter haloes. MNRAS 346 (Dec. 2003) 565--572. arXiv:astro-ph\/0301270","DOI":"10.1046\/j.1365-2966.2003.07113.x"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1046\/j.1365-2966.2003.07113.x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1994.1050"},{"key":"e_1_3_2_1_22_1","volume-title":"The cosmological simulation code GADGET-2. Monthly Notices of the Royal Astronomical Society 364 (Dec","author":"Springel V.","year":"2005","unstructured":"V. Springel . 2005. The cosmological simulation code GADGET-2. Monthly Notices of the Royal Astronomical Society 364 (Dec . 2005 ), 1105--1134. arXiv:arXiv:astro-ph\/0505010 V. Springel. 2005. The cosmological simulation code GADGET-2. Monthly Notices of the Royal Astronomical Society 364 (Dec. 2005), 1105--1134. arXiv:arXiv:astro-ph\/0505010"},{"key":"e_1_3_2_1_24_1","unstructured":"Benedikt Steinbusch Marvin-Lucas Henkel Mathias Winkel and Paul Gibbon. 2015. A Massively Parallel Barnes-Hut Tree Code with Dual Tree Traversal.. In PARCO. 439--448.  Benedikt Steinbusch Marvin-Lucas Henkel Mathias Winkel and Paul Gibbon. 2015. A Massively Parallel Barnes-Hut Tree Code with Dual Tree Traversal.. In PARCO. 439--448."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169640"}],"event":{"name":"ICS '19: 2019 International Conference on Supercomputing","location":"Phoenix Arizona","acronym":"ICS '19","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330348","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330345.3330348","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330345.3330348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:05Z","timestamp":1750204445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,26]]},"references-count":24,"alternative-id":["10.1145\/3330345.3330348","10.1145\/3330345"],"URL":"https:\/\/doi.org\/10.1145\/3330345.3330348","relation":{},"subject":[],"published":{"date-parts":[[2019,6,26]]},"assertion":[{"value":"2019-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}