Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational physics 2006-03, Vol.212 (2), p.527-539
Main Authors: Brunner, Thomas A., Urbatsch, Todd J., Evans, Thomas M., Gentile, Nicholas A.
Format: Article
Language:English
Subjects:
ALGORITHMS
CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS
COMPARATIVE EVALUATIONS
Computational techniques
ENERGY DENSITY
Exact sciences and technology
IMPLEMENTATION
K CODES
LANL
LAWRENCE LIVERMORE NATIONAL LABORATORY
Mathematical methods in physics
MONTE CARLO METHOD
Monte Carlo methods
Parallel computation
Physics
RADIANT HEAT TRANSFER
Radiative transfer
SANDIA NATIONAL LABORATORIES
THERMAL RADIATION
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0021-9991
1090-2716
DOI:10.1016/j.jcp.2005.07.009