{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:24:44Z","timestamp":1787333084582,"version":"build-2736575974"},"reference-count":22,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"name":"Spanish Government","award":["DPI2015-67857-R"],"award-info":[{"award-number":["DPI2015-67857-R"]}]},{"name":"Colombia Government","award":["001"],"award-info":[{"award-number":["001"]}]},{"DOI":"10.13039\/100010435","name":"Instituto de Ciencias Matem\u00ef\u00bf\u00bdticas","doi-asserted-by":"publisher","award":["RYC-2015-17367"],"award-info":[{"award-number":["RYC-2015-17367"]}],"id":[{"id":"10.13039\/100010435","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 this paper we present a novel algorithm for adaptive mesh refinement in computational physics meshes in a distributed memory parallel setting. The proposed method is developed for nodally based parallel domain partitions where the nodes of the mesh belong to a single processor, whereas the elements can belong to multiple processors. Some of the main features of the algorithm presented in this paper are its capability of handling multiple types of elements in two and three dimensions (triangular, quadrilateral, tetrahedral, and hexahedral), the small amount of memory required per processor, and the parallel scalability up to thousands of processors. The presented algorithm is also capable of dealing with nonbalanced hierarchical refinement, where multirefinement level jumps are possible between neighbor elements. An algorithm for dealing with load rebalancing is also presented, which allows us to move the hierarchical data structure between processors so that load unbalancing is kept below an acceptable level at all times during the simulation. A particular feature of the proposed algorithm is that arbitrary renumbering algorithms can be used in the load rebalancing step, including both graph partitioning and space-filling renumbering algorithms. The presented algorithm is packed in the Fortran 2003 object oriented library \\textttRefficientLib, whose interface calls which allow it to be used from any computational physics code are summarized. Finally, numerical experiments illustrating the performance and scalability of the algorithm are presented.<\/jats:p>","DOI":"10.1137\/15m105330x","type":"journal-article","created":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T11:48:59Z","timestamp":1490874539000},"page":"C65-C95","source":"Crossref","is-referenced-by-count":22,"title":["Refficientlib: An Efficient Load-Rebalanced Adaptive Mesh Refinement Algorithm for High-Performance Computational Physics Meshes"],"prefix":"10.1137","volume":"39","author":[{"given":"Joan","family":"Baiges","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Camilo","family":"Bayona","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2017,3,30]]},"reference":[{"key":"atypb1","volume-title":"Extensible Toolkit for Scientific Computation), version 3.7","author":"Abhyankar S.","year":"2016"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/120880732"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1145\/2049673.2049678"},{"key":"atypb4","first-page":"129","volume":"20","author":"Boman E. G.","year":"2012","journal-title":"Sci. Program."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.25"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/100791634"},{"key":"atypb7","unstructured":"P. M. Campbell, K. D. Devine, J. E. Flaherty, L. G. Gervasio, and J. D. Teresco,\n                      Dynamic Octree Load Balancing Using Space-Filling Curves\n                      , Technical Report CS-03-01, Department of Computer Science, Williams College, Williamstown, MA, 2003."},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1998.5892"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(00)00260-7"},{"key":"atypb10","unstructured":"M. Heroux, R. Bartlett, V. H. R. Hoekstra, J. Hu, T. Kolda, R. Lehoucq, K. Long, R. Pawlowski, E. Phipps, A. Salinger, H. Thornquist, R. Tuminaro, J. Willenbring, and A. Williams,\n                      An Overview of Trilinos\n                      , Technical Report SAND2003-2927, Sandia National Laboratories, Albuquerque, NM; Livermore, CA, 2003."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.47"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/100800683"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-006-0049-3"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2012.48"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9991(03)00298-5"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/090747774"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/070681727"},{"key":"atypb20","unstructured":"T. Tu and D. O'Hallaron,\n                      Balance Refinement of Massive Linear Octrees\n                      , Technical Report CMU-CS-04-129, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 2004."},{"key":"atypb21","first-page":"4","volume-title":"Proceedings of the ACM\/IEEE 2005 Conference on Supercomputing, IEEE Computer Society Press","author":"Tu T.","year":"2005"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-004-0283-5"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620240206"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M105330X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:30:47Z","timestamp":1787329847000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M105330X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1137\/15M105330X"],"URL":"https:\/\/doi.org\/10.1137\/15m105330x","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}