An efficient, robust, domain-decomposition algorithm for particle Monte Carlo

Authors:
Thomas A. Brunner;Patrick S. Brantley
Affiliations:
Sandia National Laboratories, P.O. Box 5800, Albuquerque, NM 87185-1186, United States;Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, CA 94551, United States
Venue:
Journal of Computational Physics
Year:
2009

Citing 2
Cited 6

Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

Journal of Computational Physics
An implicit Monte Carlo scheme for calculating time and frequency dependent nonlinear radiation transport

Journal of Computational Physics

Analysis of communication costs for domain decomposed Monte Carlo methods in nuclear reactor analysis

Journal of Computational Physics
Parallel particle advection and FTLE computation for time-varying flow fields

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Parallel Monte Carlo radiosity using scene partitioning

International Journal of High Performance Computing Applications
Data decomposition of Monte Carlo particle transport simulations via tally servers

Journal of Computational Physics
Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations

Journal of Computational Physics
Overcoming extreme-scale reproducibility challenges through a unified, targeted, and multilevel toolset

SE-HPCCSE '13 Proceedings of the 1st International Workshop on Software Engineering for High Performance Computing in Computational Science and Engineering

Quantified Score

Hi-index	31.47

Visualization

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.