{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T23:03:15Z","timestamp":1777676595832,"version":"3.51.4"},"reference-count":23,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2015,7,13]],"date-time":"2015-07-13T00:00:00Z","timestamp":1436745600000},"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":[[2016,5]]},"abstract":"<jats:p>Simulation of the nonlinear mechanical response of materials with explicit representation of microstructural features is extremely challenging. These models typically involve a very large number of degrees of freedom, and are prone to convergence difficulties when searching for roots to nonlinear equilibrium equations. We focus on an idealized material model that is motivated by the microstructure of synthetic nacre: individual \u2018bricks\u2019 (representing ceramic platelets) interact through nonlinear cohesive springs (representing a small volume fraction of polymer that bonds the platelets). The model simulates composite fracture through rupture of the cohesive springs. The problem is cast in terms of energy minimization and is essentially described by \u2018nearest neighbor\u2019 interactions. The principal focus of this paper is to illustrate the computational gains achievable by the strategic marriage of robust, global Monte Carlo minimization algorithms to the graphics processing unit architecture, and to describe how they were realized on the Nvidia GPU. Results comparing the computation times for graphics processing unit and central processing unit implementations demonstrate that a new adaptive version of the simulated annealing algorithm yields a speedup of approximately 5 times, whereas the graphics processing unit implementation yields a speed-up of about 16 times over conventional four-core central processing unit implementations. The resulting speed enhancement for adaptive graphics processing unit minimization of a factor of 80 enables a far broader range of simulations than has previously been possible. Simulations involving as many as 300,000 bricks can be performed in hours, as compared to weeks required by central processing unit implementation. Many aspects of this approach are translatable to other physical problems involving energy minimization in systems with large numbers of degrees of freedom.<\/jats:p>","DOI":"10.1177\/1094342015593395","type":"journal-article","created":{"date-parts":[[2015,7,13]],"date-time":"2015-07-13T21:30:52Z","timestamp":1436823052000},"page":"186-199","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":11,"title":["High-performance simulation of fracture in idealized \u2018brick and mortar\u2019 composites using adaptive Monte Carlo minimization on the GPU"],"prefix":"10.1177","volume":"30","author":[{"given":"Rone Kwei","family":"Lim","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of California Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J William","family":"Pro","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of California Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew R","family":"Begley","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of California Santa Barbara, USA"},{"name":"Department of Materials, University of California Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Utz","sequence":"additional","affiliation":[{"name":"School of Chemistry, University of Southampton, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda R","family":"Petzold","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of California Santa Barbara, USA"},{"name":"Department of Mechanical Engineering, University of California Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,7,13]]},"reference":[{"key":"bibr1-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1007\/s11340-007-9040-1"},{"key":"bibr2-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmps.2011.01.001"},{"key":"bibr3-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmps.2006.07.007"},{"key":"bibr4-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511975905"},{"key":"bibr5-1094342015593395","volume":"37","author":"Chan TF","year":"1983","journal-title":"The American Statistician"},{"key":"bibr6-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1145\/29380.29864"},{"key":"bibr7-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1557\/JMR.2001.0339"},{"key":"bibr8-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749"},{"key":"bibr9-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90204-C"},{"key":"bibr10-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1007\/BF00587670"},{"key":"bibr11-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1038\/35016535"},{"key":"bibr12-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"bibr13-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1145\/1268776.1268777"},{"key":"bibr14-1094342015593395","volume":"33","author":"Laurent F","year":"2007","journal-title":"ACM Transactions on Mathematical Software"},{"key":"bibr15-1094342015593395","author":"Matsumoto M","year":"1998","journal-title":"Monte Carlo and Quasi-Monte Carlo Methods"},{"key":"bibr16-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmatsci.2007.05.002"},{"key":"bibr17-1094342015593395","unstructured":"Nvidia CUDA (2011a) C Programming Guide, Version 4.0."},{"key":"bibr18-1094342015593395","unstructured":"Nvidia CUDA (2011b) API Reference Manual, Version 4.0."},{"key":"bibr19-1094342015593395","unstructured":"Nvidia CUDA (2011c) C Best Practices Guide, Version 4.0."},{"key":"bibr20-1094342015593395","unstructured":"Podlozhnyuk V (2007). Parallel Mersenne Twister. Nvidia. Available at: http:\/\/developer.download.nvidia.com\/assets\/cuda\/files\/MersenneTwister.pdf."},{"key":"bibr21-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmps.2015.03.011"},{"key":"bibr22-1094342015593395","doi-asserted-by":"publisher","DOI":"10.1016\/j.actbio.2010.04.008"},{"key":"bibr23-1094342015593395","unstructured":"United States National Institute of Standards and Technology (2001) Federal Information Processing Standards Publication 197. Advanced Encryption Standard (AES). United States National Institute of Standards and Technology. Available at: http:\/\/csrc.nist.gov\/publications\/fips\/fips197\/fips-197.pdf."}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342015593395","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342015593395","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342015593395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:19:35Z","timestamp":1777450775000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342015593395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,13]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["10.1177\/1094342015593395"],"URL":"https:\/\/doi.org\/10.1177\/1094342015593395","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,13]]}}}