{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:41:22Z","timestamp":1787330482707,"version":"build-2736575974"},"reference-count":56,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003542","name":"Ministerium f\u00fcr Wissenschaft, Forschung und Kunst Baden-W\u00c3\u00bcrttemberg","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008131","name":"Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008131","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p>In tree-based adaptive mesh refinement, elements are partitioned between processes using a space-filling curve. The curve establishes an ordering between all elements that derive from the same root element, the tree. When representing complex geometries by connecting several trees, the roots of these trees form an unstructured coarse mesh. We present an algorithm to partition the elements of the coarse mesh such that (a) the fine mesh can be load-balanced to equal element counts per process regardless of the element-to-tree map, and (b) each process that holds fine mesh elements has access to the meta data of all relevant trees. As an additional feature, the algorithm partitions the meta data of relevant ghost (halo) trees as well. We develop in detail how each process computes the communication pattern for the partition routine without handshaking and with minimal data movement. We demonstrate the scalability of this approach on up to 917e3 MPI ranks and 371e9 coarse mesh elements, measuring run times of one second or less.<\/jats:p>","DOI":"10.1137\/16m1103518","type":"journal-article","created":{"date-parts":[[2017,10,10]],"date-time":"2017-10-10T16:38:04Z","timestamp":1507653484000},"page":"C364-C392","source":"Crossref","is-referenced-by-count":7,"title":["Coarse Mesh Partitioning for Tree-Based AMR"],"prefix":"10.1137","volume":"39","author":[{"given":"Carsten","family":"Burstedde","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Holke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2017,10,10]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620121010"},{"key":"atypb2","volume-title":"Texts in Comput. Sci. Eng.","author":"Bader M.","year":"2012"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/11758501_90"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1145\/1268776.1268779"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(89)90035-1"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(84)90073-1"},{"key":"atypb7","volume-title":"Parallelisierung und Simulation, preprint","author":"Bey J.","year":"1992"},{"key":"atypb8","volume-title":"Laboratory for Computational Astrophysics","author":"Bryan G.","year":"2016"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31768-6_7"},{"key":"atypb10","unstructured":"C. Burstedde,\n                      p4est: Parallel AMR on Forests of Octrees\n                      ,http:\/\/www.p4est.org\/(accessed February 27, 2015)."},{"key":"atypb11","first-page":"253","volume-title":"Parallel Computing: Accelerating Computational Science and Engineering (CSE), M. Bader, A. Bode, H.-J","author":"Burstedde C.","year":"2014"},{"key":"atypb12","first-page":"1","volume-title":"SC10: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, IEEE","author":"Burstedde C.","year":"2010"},{"key":"atypb13","volume-title":"Proc. Teragrid '08","author":"Burstedde C.","year":"2008"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/15M1040049"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/100791634"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370258"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1109\/5992.988653"},{"key":"atypb19","volume-title":"Presentation at PETSc User Meeting","author":"Digonnet H.","year":"2016"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.04.011"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2016.07.010"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1002\/nme.2579"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(99)00020-4"},{"key":"atypb24","first-page":"479","volume-title":"Proc. NIC Symposium 2001","author":"Griebel M.","year":"2002"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199431"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1145\/2814935"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/140970963"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2006.12.008"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.17815\/jlsrf-1-18"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1403"},{"key":"atypb31","volume-title":"Report GWMI 2016-01","author":"Maxwell R.","year":"2016"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1145\/2947668"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2016.06.017"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.11.003"},{"key":"atypb35","volume-title":"Tech. report","author":"Morton G. M.","year":"1966"},{"key":"atypb36","volume-title":"Tech. report, Jet Propulsion Laboratory","author":"Norton C. D.","year":"2004"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199438"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.05.003"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.42"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2014.75"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1145\/355887.355891"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1088\/0067-0049\/186\/2\/457"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(19991210)11:14<863::AID-CPE464>3.0.CO;2-T"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014497"},{"key":"atypb45","volume-title":"TetGen---A Quality Tetrahedral Mesh Generator and Three-Dimensional Delaunay Triangulator","author":"Si H.","year":"2006"},{"key":"atypb46","first-page":"462","author":"Sierpi\u0144ski W.","year":"1912","journal-title":"Bull. Acad. Sci. Cracovie S\u00e9r. A"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(89)90089-2"},{"key":"atypb48","volume-title":"Tech. report 2015-3","author":"Smith C. W.","year":"2015"},{"key":"atypb49","first-page":"559","volume":"24","author":"Steinman D. A.","year":"2003","journal-title":"Amer. J. Neuroradiology"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1016\/j.finel.2003.10.006"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1137\/070681727"},{"key":"atypb52","volume-title":"SC '05: Proceedings of the 2005 ACM\/IEEE Conference on Supercomputing, ACM\/IEEE, 2005","author":"Tu T.","year":"2005"},{"key":"atypb53","doi-asserted-by":"publisher","DOI":"10.1137\/100799071"},{"key":"atypb54","volume-title":"PREMA-Partnership for Advanced Computing in Europe","author":"Y.","year":"2010"},{"key":"atypb55","doi-asserted-by":"publisher","DOI":"10.1137\/090777323"},{"key":"atypb56","volume-title":"Vieweg+Teubner","author":"Zumbusch G.","year":"2003"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1103518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:08:31Z","timestamp":1787328511000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1103518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":56,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1137\/16M1103518"],"URL":"https:\/\/doi.org\/10.1137\/16m1103518","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}