An efficient, robust, domain-decomposition algorithm for particle Monte Carlo
- Sandia National Laboratories, P.O. Box 5800, Albuquerque, NM 87185-1186 (United States), E-mail: tabrunn@sandia.gov
- Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, CA 94551 (United States), E-mail: brantley1@llnl.gov
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, Vol. 228, Issue 10; Other Information: DOI: 10.1016/j.jcp.2009.02.013; PII: S0021-9991(09)00096-5; Copyright (c) 2009 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved; Country of input: International Atomic Energy Agency (IAEA); ISSN 0021-9991
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimization of processor allocation for domain decomposed Monte Carlo calculations
Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms