Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

Journal Article · Wed Mar 01 00:00:00 EST 2006 · Journal of Computational Physics

DOI:https://doi.org/10.1016/j.jcp.2005.07.009· OSTI ID:20767030

Brunner, Thomas A ^[1]; Urbatsch, Todd J ^[2]; Evans, Thomas M ^[2]; Gentile, Nicholas A ^[3]

---

1. Sandia National Laboratories, Target and Z-Pinch Theory, P.O. Box 5800, Albuquerque, NM 87185-1186 (United States)
2. Los Alamos National Laboratory, P.O. Box 1663, Los Alamos, NM 87545 (United States)
3. University of California, Lawrence Livermore National Laboratory, 7000 East Avenue, Livermore, CA 94550 (United States)

We consider four asynchronous parallel algorithms for Implicit Monte Carlo (IMC) thermal radiation transport on spatially decomposed meshes. Two of the algorithms are from the production codes KULL from Lawrence Livermore National Laboratory and Milagro from Los Alamos National Laboratory. Improved versions of each of the existing algorithms are also presented. All algorithms were analyzed in an implementation of the KULL IMC package in ALEGRA, a Sandia National Laboratory high energy density physics code. The improved Milagro algorithm performed the best by scaling almost linearly out to 244 processors for well load balanced problems.

• OSTI ID: 20767030
• Journal Information: Journal of Computational Physics, Vol. 212, Issue 2; Other Information: DOI: 10.1016/j.jcp.2005.07.009; PII: S0021-9991(05)00331-1; Copyright (c) 2005 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

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGORITHMS
COMPARATIVE EVALUATIONS
ENERGY DENSITY
IMPLEMENTATION
K CODES
LANL
LAWRENCE LIVERMORE NATIONAL LABORATORY
MONTE CARLO METHOD
RADIANT HEAT TRANSFER
SANDIA NATIONAL LABORATORIES
THERMAL RADIATION