An efficient, robust, domain-decomposition algorithm for particle Monte Carlo
Journal Article
·
· Journal of Computational Physics
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.
- OSTI ID:
- 21308090
- Journal Information:
- Journal of Computational Physics, Journal Name: Journal of Computational Physics Journal Issue: 10 Vol. 228; ISSN JCTPAH; ISSN 0021-9991
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Multiple-Set Overlapping-Domain Decomposed Monte Carlo Synthetic Acceleration Method for Linear Systems
Scalable Domain Decomposed Monte Carlo Particle Transport
Optimization of processor allocation for domain decomposed Monte Carlo calculations
Conference
·
Tue Dec 31 23:00:00 EST 2013
· SNA + MC 2013 - JOINT INTERNATIONAL CONFERENCE ON SUPERCOMPUTING IN NUCLEAR APPLICATIONS + MONTE CARLO
·
OSTI ID:1567361
Scalable Domain Decomposed Monte Carlo Particle Transport
Thesis/Dissertation
·
Wed Dec 04 23:00:00 EST 2013
·
OSTI ID:1116906
Optimization of processor allocation for domain decomposed Monte Carlo calculations
Journal Article
·
Thu Jun 20 20:00:00 EDT 2019
· Parallel Computing
·
OSTI ID:1558566