Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

Thomas A. Brunner; Todd J. Urbatsch; Thomas M. Evans; Nicholas A. Gentile

doi:10.1016/j.jcp.2005.07.009

Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

Thomas A. Brunner, Todd J. Urbatsch, Thomas M. Evans, Nicholas A. Gentile

Research output: Contribution to journal › Article › peer-review

32 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	527-539
Number of pages	13
Journal	Journal of Computational Physics
Volume	212
Issue number	2
DOIs	https://doi.org/10.1016/j.jcp.2005.07.009
State	Published - Mar 1 2006
Externally published	Yes

Keywords

Monte Carlo methods
Parallel computation
Radiative transfer

Access to Document

10.1016/j.jcp.2005.07.009

Cite this

@article{4a616ae5189c45408dc50c6afbe749b5,

title = "Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo",

abstract = "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.",

keywords = "Monte Carlo methods, Parallel computation, Radiative transfer",

author = "Brunner, {Thomas A.} and Urbatsch, {Todd J.} and Evans, {Thomas M.} and Gentile, {Nicholas A.}",

year = "2006",

month = mar,

day = "1",

doi = "10.1016/j.jcp.2005.07.009",

language = "English",

volume = "212",

pages = "527--539",

journal = "Journal of Computational Physics",

issn = "0021-9991",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

AU - Brunner, Thomas A.

AU - Urbatsch, Todd J.

AU - Evans, Thomas M.

AU - Gentile, Nicholas A.

PY - 2006/3/1

Y1 - 2006/3/1

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

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

KW - Monte Carlo methods

KW - Parallel computation

KW - Radiative transfer

UR - http://www.scopus.com/inward/record.url?scp=29144462734&partnerID=8YFLogxK

U2 - 10.1016/j.jcp.2005.07.009

DO - 10.1016/j.jcp.2005.07.009

M3 - Article

AN - SCOPUS:29144462734

SN - 0021-9991

VL - 212

SP - 527

EP - 539

JO - Journal of Computational Physics

JF - Journal of Computational Physics

IS - 2

ER -

Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this