{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T12:11:52Z","timestamp":1787919112886,"version":"build-2784847793"},"reference-count":44,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2012,2,5]],"date-time":"2012-02-05T00:00:00Z","timestamp":1328400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p>Developing computational tools that enable discovery of new materials for energy-related applications is a challenge. Crystalline porous materials are a promising class of materials that can be used for oil refinement, hydrogen or methane storage as well as carbon dioxide capture. Selecting optimal materials for these important applications requires analysis and screening of millions of potential candidates. Recently, we proposed an automatic approach based on the Fast Marching Method (FMM) for performing analysis of void space inside materials, a critical step preceding expensive molecular dynamics simulations. This breakthrough enables unsupervised, high-throughput characterization of large material databases. The algorithm has three steps: (1) calculation of the cost-grid which represents the structure and encodes the occupiable positions within the void space; (2) using FMM to segment out patches of the void space in the grid of (1), and find how they are connected to form either periodic channels or inaccessible pockets; and (3) generating blocking spheres that encapsulate the discovered inaccessible pockets and are used in proceeding molecular simulations. In this work, we expand upon our original approach through (A) replacement of the FMM-based approach with a more computationally efficient flood fill algorithm; and (B) parallelization of all steps in the algorithm, including a GPU implementation of the most computationally expensive step, the cost-grid generation. We report the acceleration achievable in each step and in the complete application, and discuss the implications for high-throughput material screening.<\/jats:p>","DOI":"10.1177\/1094342011431591","type":"journal-article","created":{"date-parts":[[2012,2,6]],"date-time":"2012-02-06T23:30:26Z","timestamp":1328571026000},"page":"347-357","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":17,"title":["Accelerating analysis of void space in porous materials on multicore and GPU platforms"],"prefix":"10.1177","volume":"26","author":[{"given":"Richard L","family":"Martin","sequence":"first","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Prabhat","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David D","family":"Donofrio","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James A","family":"Sethian","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, USA"},{"name":"Department of Mathematics, University of California, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maciej","family":"Haranczyk","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2012,2,5]]},"reference":[{"key":"bibr1-1094342011431591","volume-title":"Handbook of Zeolite Science and Technology","author":"Auerbach SM","year":"2004"},{"key":"bibr2-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1126\/science.1152516"},{"key":"bibr3-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ja953856q"},{"key":"bibr4-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1039\/c0cp02833a"},{"key":"bibr5-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1107\/S0108768106039425"},{"key":"bibr6-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ja8024092"},{"key":"bibr7-1094342011431591","unstructured":"CUDPP (2011). CUDA Data Parallel Primitives Library. http:\/\/code.google.com\/p\/cudpp\/."},{"key":"bibr8-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/jp906984z"},{"key":"bibr9-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"bibr10-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/jp035200m"},{"key":"bibr11-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ie0510728"},{"key":"bibr12-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1039\/c1cp21731c"},{"key":"bibr13-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1016\/j.micromeso.2005.08.025"},{"key":"bibr14-1094342011431591","first-page":"2010","volume":"13","author":"Foster MD","year":"2010","journal-title":"The Hypothetical Zeolites Database. http:\/\/www.hypotheticalzeolites.net (accessed Nov"},{"key":"bibr15-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012267351-1\/50005-5"},{"key":"bibr16-1094342011431591","unstructured":"GPGPU.org (2011). General-purpose computation on graphics hardware. http:\/\/www.gpgpu.org\/."},{"key":"bibr17-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ja1023699"},{"key":"bibr18-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0910016106"},{"key":"bibr19-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ct100433z"},{"key":"bibr20-1094342011431591","author":"Jeong W","year":"2007","journal-title":"Proceedings of the SIAM Conference on Computational Science and Engineering"},{"key":"bibr21-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1126\/science.1208652"},{"key":"bibr22-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1016\/0263-7855(96)00040-9"},{"key":"bibr23-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1016\/j.cej.2007.02.011"},{"key":"bibr24-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/la9041875"},{"key":"bibr25-1094342011431591","first-page":"501","author":"Kr\u00fcger F","year":"2010","journal-title":"Proceedings of EvoApplications (1)"},{"key":"bibr26-1094342011431591","first-page":"1403","author":"Maitre O","year":"2009","journal-title":"Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009"},{"key":"bibr27-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03869-3_89"},{"key":"bibr28-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ja0570032"},{"key":"bibr29-1094342011431591","unstructured":"NVIDIA (2011a) CUDA Developer Zone. http:\/\/www.nvidia.com\/object\/cuda_home_new.html."},{"key":"bibr30-1094342011431591","unstructured":"NVIDIA (2011b) GPU Computing. http:\/\/www.nvidia.com\/object\/GPU_Computing.html."},{"key":"bibr31-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-316"},{"key":"bibr32-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.4.1591"},{"key":"bibr33-1094342011431591","doi-asserted-by":"crossref","unstructured":"Sethian JA (1999). Level Set Methods and Fast Marching Methods, 2nd ed. New York: Cambridge University Press, 86\u201399.","DOI":"10.1137\/S0036144598347059"},{"key":"bibr34-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1038\/nature06552"},{"key":"bibr35-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/cr8002642"},{"key":"bibr36-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmgm.2010.06.010"},{"key":"bibr37-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ja9072707"},{"key":"bibr38-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ci900451v"},{"key":"bibr39-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1007\/s00894-009-0541-y"},{"key":"bibr40-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ct700268q"},{"key":"bibr41-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ct800526s"},{"key":"bibr42-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ct9003004"},{"key":"bibr43-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1021\/ja076595g"},{"key":"bibr44-1094342011431591","doi-asserted-by":"publisher","DOI":"10.1016\/j.micromeso.2011.08.020"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342011431591","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342011431591","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342011431591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:19:08Z","timestamp":1777450748000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342011431591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,5]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1177\/1094342011431591"],"URL":"https:\/\/doi.org\/10.1177\/1094342011431591","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,5]]}}}