.png){kind=icon}
.png){kind=icon}
Return
Optimizing Memory Constrained Environments in Monte Carlo Nuclear Reactor Simulations
.png){kind=icon}
PRE
AI
DOI：10.1177/1094342012445627.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Monte Carlo neutron transport codes are a growing subject of research in nuclear reactor analysis. For robust reactor analysis, large scale neutron transport simulations require computation of reaction rates for tens of billions of particles involving several hundred isotopes. When employing physical-space domain decomposition, minimizing memory consumption while safely and efficiently exchanging massive amounts of data is a significant challenge. To address this problem, we implement and test several memory-aware, in-place, sparse, all-to-all MPI communication implementations. The algorithms are developed and tested within the open source MADRE (Memory-Aware Data Redistribution) project, which gives application programmers a simple API and set of tools and algorithms for carrying out memory-transparent in-place communication. We explore memory and communication efficiency tradeoffs for a range of in-place algorithms using a simple Monte Carlo communication kernel intended to mimic the behavior of our full Monte Carlo neutronics code.
Keywords:
Monte Carlo
neutron
reactor analysis limited
memory domain
decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.1K
Citations:
1.3K