Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo.

Journal Article · Tue Nov 30 23:00:00 EST 2004 · Proposed for publication in the Journal of Computational Physics.

OSTI ID:915137

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

---

1. Los Alamos National Laboratory, Los Alamos, NM
2. Los Alamos National Laboratory, Los Alamos, NM
3. Lawrence Livermore National Laboratory, Livermore, CA

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.

• Research Organization: Sandia National Laboratories
• Sponsoring Organization: USDOE
• DOE Contract Number: AC04-94AL85000
• OSTI ID: 915137
• Report Number(s): SAND2004-6694J
• Journal Information: Proposed for publication in the Journal of Computational Physics., Journal Name: Proposed for publication in the Journal of Computational Physics.
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
99 GENERAL AND MISCELLANEOUS
ALGORITHMS
COMPARATIVE EVALUATIONS
MONTE CARLO METHOD
PARALLEL PROCESSING
THERMAL RADIATION
TRANSPORT