An efficient, robust, domain-decomposition algorithm for particle Monte Carlo
A previously described algorithm [T.A. Brunner, T.J. Urbatsch, T.M. Evans, N.A. Gentile, Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo, Journal of Computational Physics 212 (2) (2006) 527–539] for doing domain decomposed particle Monte Carlo calculations in the co...
Gespeichert in:
| Veröffentlicht in: | Journal of computational physics 2009-06, Vol.228 (10), p.3882-3890 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 3890 |
|---|---|
| container_issue | 10 |
| container_start_page | 3882 |
| container_title | Journal of computational physics |
| container_volume | 228 |
| creator | Brunner, Thomas A. Brantley, Patrick S. |
| description | A previously described algorithm [T.A. Brunner, T.J. Urbatsch, T.M. Evans, N.A. Gentile, Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo, Journal of Computational Physics 212 (2) (2006) 527–539] for doing domain decomposed particle Monte Carlo calculations in the context of thermal radiation transport has been improved. It has been extended to support cases where the number of particles in a time step are unknown at the beginning of the time step. This situation arises when various physical processes, such as neutron transport, can generate additional particles during the time step, or when particle splitting is used for variance reduction. Additionally, several race conditions that existed in the previous algorithm and could cause code hangs have been fixed. This new algorithm is believed to be robust against all race conditions. The parallel scalability of the new algorithm remains excellent. |
| doi_str_mv | 10.1016/j.jcp.2009.02.013 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_osti_</sourceid><recordid>TN_cdi_osti_scitechconnect_21308090</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0021999109000965</els_id><sourcerecordid>34274488</sourcerecordid><originalsourceid>FETCH-LOGICAL-c495t-5d9f109b669c8e3172c90bb0f1aaaf5ae8c36322a81224675d368333a6cd12043</originalsourceid><addsrcrecordid>eNp9kE2LFDEQhoMoOK7-AG8Noie7rST9keBpGXRX2MWLnkOmuuJm6E7aJCPsvzfDLB491eWpt956GHvLoePAx0_H7ohbJwB0B6IDLp-xHQcNrZj4-JztAARvtdb8JXuV8xEA1NCrHbu_Dg0559FTKB-bFA-nXOccV-tDOxPGdYvZFx9DY5dfMfnysDYupmazqXhcqLmPoVCzt2mJr9kLZ5dMb57mFfv59cuP_W179_3m2_76rsVeD6UdZu1qucM4alQk-SRQw-EAjltr3WBJoRylEFZxIfpxGmY5KimlHXHmAnp5xd5dcmMu3mT0hfABYwiExQguQdXXK_XhQm0p_j5RLmb1GWlZbKB4ykb2Yup7pSrILyCmmHMiZ7bkV5seDQdz1muOpuo1Z70GhKl66877p3Cb0S4u2YA-_1sUvOeTlLpyny8cVR9_PKVzXQpIs0_ntnP0_7nyFy6qjjI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>34274488</pqid></control><display><type>article</type><title>An efficient, robust, domain-decomposition algorithm for particle Monte Carlo</title><source>Elsevier ScienceDirect Journals</source><creator>Brunner, Thomas A. ; Brantley, Patrick S.</creator><creatorcontrib>Brunner, Thomas A. ; Brantley, Patrick S.</creatorcontrib><description>A previously described algorithm [T.A. Brunner, T.J. Urbatsch, T.M. Evans, N.A. Gentile, Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo, Journal of Computational Physics 212 (2) (2006) 527–539] for doing domain decomposed particle Monte Carlo calculations in the context of thermal radiation transport has been improved. It has been extended to support cases where the number of particles in a time step are unknown at the beginning of the time step. This situation arises when various physical processes, such as neutron transport, can generate additional particles during the time step, or when particle splitting is used for variance reduction. Additionally, several race conditions that existed in the previous algorithm and could cause code hangs have been fixed. This new algorithm is believed to be robust against all race conditions. The parallel scalability of the new algorithm remains excellent.</description><identifier>ISSN: 0021-9991</identifier><identifier>EISSN: 1090-2716</identifier><identifier>DOI: 10.1016/j.jcp.2009.02.013</identifier><identifier>CODEN: JCTPAH</identifier><language>eng</language><publisher>Kidlington: Elsevier Inc</publisher><subject>ALGORITHMS ; Computational techniques ; DECOMPOSITION ; Exact sciences and technology ; Mathematical methods in physics ; MONTE CARLO METHOD ; Monte Carlo methods ; NEUTRON TRANSPORT ; NUCLEAR PHYSICS AND RADIATION PHYSICS ; Parallel computation ; Physics ; RADIANT HEAT TRANSFER ; Radiative transfer ; THERMAL RADIATION</subject><ispartof>Journal of computational physics, 2009-06, Vol.228 (10), p.3882-3890</ispartof><rights>2009 Elsevier Inc.</rights><rights>2009 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c495t-5d9f109b669c8e3172c90bb0f1aaaf5ae8c36322a81224675d368333a6cd12043</citedby><cites>FETCH-LOGICAL-c495t-5d9f109b669c8e3172c90bb0f1aaaf5ae8c36322a81224675d368333a6cd12043</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0021999109000965$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,776,780,881,3536,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21417339$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://www.osti.gov/biblio/21308090$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>Brunner, Thomas A.</creatorcontrib><creatorcontrib>Brantley, Patrick S.</creatorcontrib><title>An efficient, robust, domain-decomposition algorithm for particle Monte Carlo</title><title>Journal of computational physics</title><description>A previously described algorithm [T.A. Brunner, T.J. Urbatsch, T.M. Evans, N.A. Gentile, Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo, Journal of Computational Physics 212 (2) (2006) 527–539] for doing domain decomposed particle Monte Carlo calculations in the context of thermal radiation transport has been improved. It has been extended to support cases where the number of particles in a time step are unknown at the beginning of the time step. This situation arises when various physical processes, such as neutron transport, can generate additional particles during the time step, or when particle splitting is used for variance reduction. Additionally, several race conditions that existed in the previous algorithm and could cause code hangs have been fixed. This new algorithm is believed to be robust against all race conditions. The parallel scalability of the new algorithm remains excellent.</description><subject>ALGORITHMS</subject><subject>Computational techniques</subject><subject>DECOMPOSITION</subject><subject>Exact sciences and technology</subject><subject>Mathematical methods in physics</subject><subject>MONTE CARLO METHOD</subject><subject>Monte Carlo methods</subject><subject>NEUTRON TRANSPORT</subject><subject>NUCLEAR PHYSICS AND RADIATION PHYSICS</subject><subject>Parallel computation</subject><subject>Physics</subject><subject>RADIANT HEAT TRANSFER</subject><subject>Radiative transfer</subject><subject>THERMAL RADIATION</subject><issn>0021-9991</issn><issn>1090-2716</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNp9kE2LFDEQhoMoOK7-AG8Noie7rST9keBpGXRX2MWLnkOmuuJm6E7aJCPsvzfDLB491eWpt956GHvLoePAx0_H7ohbJwB0B6IDLp-xHQcNrZj4-JztAARvtdb8JXuV8xEA1NCrHbu_Dg0559FTKB-bFA-nXOccV-tDOxPGdYvZFx9DY5dfMfnysDYupmazqXhcqLmPoVCzt2mJr9kLZ5dMb57mFfv59cuP_W179_3m2_76rsVeD6UdZu1qucM4alQk-SRQw-EAjltr3WBJoRylEFZxIfpxGmY5KimlHXHmAnp5xd5dcmMu3mT0hfABYwiExQguQdXXK_XhQm0p_j5RLmb1GWlZbKB4ykb2Yup7pSrILyCmmHMiZ7bkV5seDQdz1muOpuo1Z70GhKl66877p3Cb0S4u2YA-_1sUvOeTlLpyny8cVR9_PKVzXQpIs0_ntnP0_7nyFy6qjjI</recordid><startdate>20090601</startdate><enddate>20090601</enddate><creator>Brunner, Thomas A.</creator><creator>Brantley, Patrick S.</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7U5</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>OTOTI</scope></search><sort><creationdate>20090601</creationdate><title>An efficient, robust, domain-decomposition algorithm for particle Monte Carlo</title><author>Brunner, Thomas A. ; Brantley, Patrick S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c495t-5d9f109b669c8e3172c90bb0f1aaaf5ae8c36322a81224675d368333a6cd12043</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>ALGORITHMS</topic><topic>Computational techniques</topic><topic>DECOMPOSITION</topic><topic>Exact sciences and technology</topic><topic>Mathematical methods in physics</topic><topic>MONTE CARLO METHOD</topic><topic>Monte Carlo methods</topic><topic>NEUTRON TRANSPORT</topic><topic>NUCLEAR PHYSICS AND RADIATION PHYSICS</topic><topic>Parallel computation</topic><topic>Physics</topic><topic>RADIANT HEAT TRANSFER</topic><topic>Radiative transfer</topic><topic>THERMAL RADIATION</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brunner, Thomas A.</creatorcontrib><creatorcontrib>Brantley, Patrick S.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>OSTI.GOV</collection><jtitle>Journal of computational physics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brunner, Thomas A.</au><au>Brantley, Patrick S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An efficient, robust, domain-decomposition algorithm for particle Monte Carlo</atitle><jtitle>Journal of computational physics</jtitle><date>2009-06-01</date><risdate>2009</risdate><volume>228</volume><issue>10</issue><spage>3882</spage><epage>3890</epage><pages>3882-3890</pages><issn>0021-9991</issn><eissn>1090-2716</eissn><coden>JCTPAH</coden><abstract>A previously described algorithm [T.A. Brunner, T.J. Urbatsch, T.M. Evans, N.A. Gentile, Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo, Journal of Computational Physics 212 (2) (2006) 527–539] for doing domain decomposed particle Monte Carlo calculations in the context of thermal radiation transport has been improved. It has been extended to support cases where the number of particles in a time step are unknown at the beginning of the time step. This situation arises when various physical processes, such as neutron transport, can generate additional particles during the time step, or when particle splitting is used for variance reduction. Additionally, several race conditions that existed in the previous algorithm and could cause code hangs have been fixed. This new algorithm is believed to be robust against all race conditions. The parallel scalability of the new algorithm remains excellent.</abstract><cop>Kidlington</cop><pub>Elsevier Inc</pub><doi>10.1016/j.jcp.2009.02.013</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0021-9991 |
| ispartof | Journal of computational physics, 2009-06, Vol.228 (10), p.3882-3890 |
| issn | 0021-9991 1090-2716 |
| language | eng |
| recordid | cdi_osti_scitechconnect_21308090 |
| source | Elsevier ScienceDirect Journals |
| subjects | ALGORITHMS Computational techniques DECOMPOSITION Exact sciences and technology Mathematical methods in physics MONTE CARLO METHOD Monte Carlo methods NEUTRON TRANSPORT NUCLEAR PHYSICS AND RADIATION PHYSICS Parallel computation Physics RADIANT HEAT TRANSFER Radiative transfer THERMAL RADIATION |
| title | An efficient, robust, domain-decomposition algorithm for particle Monte Carlo |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T19%3A28%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_osti_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20efficient,%20robust,%20domain-decomposition%20algorithm%20for%20particle%20Monte%20Carlo&rft.jtitle=Journal%20of%20computational%20physics&rft.au=Brunner,%20Thomas%20A.&rft.date=2009-06-01&rft.volume=228&rft.issue=10&rft.spage=3882&rft.epage=3890&rft.pages=3882-3890&rft.issn=0021-9991&rft.eissn=1090-2716&rft.coden=JCTPAH&rft_id=info:doi/10.1016/j.jcp.2009.02.013&rft_dat=%3Cproquest_osti_%3E34274488%3C/proquest_osti_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=34274488&rft_id=info:pmid/&rft_els_id=S0021999109000965&rfr_iscdi=true |