Scalable Domain Decomposed Monte Carlo Particle Transport
- Univ. of California, Davis, CA (United States)
In this dissertation, we present the parallel algorithms necessary to run domain decomposed Monte Carlo particle transport on large numbers of processors (millions of processors). Previous algorithms were not scalable, and the parallel overhead became more computationally costly than the numerical simulation.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 1116906
- Report Number(s):
- LLNL-TH--647500
- Country of Publication:
- United States
- Language:
- English
Similar Records
Particle Communication and Domain Neighbor Coupling: Scalable Domain Decomposed Algorithms for Monte Carlo Particle Transport
Optimization of processor allocation for domain decomposed Monte Carlo calculations
Obtaining Identical Results on Varying Numbers of Processors In Domain Decomposed particle Monte Carlo Simulations
Conference
·
Mon Jan 19 23:00:00 EST 2015
·
OSTI ID:1179433
Optimization of processor allocation for domain decomposed Monte Carlo calculations
Journal Article
·
Thu Jun 20 20:00:00 EDT 2019
· Parallel Computing
·
OSTI ID:1558566
Obtaining Identical Results on Varying Numbers of Processors In Domain Decomposed particle Monte Carlo Simulations
Conference
·
Mon Mar 21 23:00:00 EST 2005
·
OSTI ID:15015123