Domain Decomposition of Combinatorial Geometry Monte Carlo Simulation for Memory Overload Full-Core Nuclear Reactor
-
摘要: 随着对核反应堆的数值模拟描述越来越精细,全堆芯pin-by-pin精细建模需要的几何数量越来越多,对计算机内存提出了更高要求。本文针对大内存模型对蒙特卡罗组合几何区域分解的并行算法开展研究,详细阐述了基于树结构存储的区域剖分算法,并使用区域分解技术计算了大亚湾核电站压水堆的全堆芯pin-by-pin模型,初步验证了算法的可行性和正确性,为精细模型的输运燃耗耦合计算提供了可行性。
-
关键词:
- 组合几何 /
- 区域分解 /
- 蒙特卡罗 /
- pin-by-pin /
- JMCT
Abstract: With the development of computer technology and the increasing requirement on nuclear reactor physics, the full-core reactor model contains too many cells and tallies to be loaded for Monte Carlo transport simulation on a single core processor. A domain decomposition of combinatorial geometry Monte Carlo transport is presented in this paper, to simulate the models overload the CPU memory. The tree-based decomposition and asynchronous communication of particle information between domains are also described in the paper. A full-core reactor model from Daya Bay nuclear power station is simulated to verify the domain decomposition algorithms. The domain decomposition provides an available way for the coupled transport and burn-up simulation of the full-core reactor model.-
Key words:
- Combinatorial geometry /
- Domain decomposition /
- Monte Carlo /
- Pin-by-pin /
- JMCT
-
计量
- 文章访问数: 16
- HTML全文浏览量: 6
- PDF下载量: 0
- 被引次数: 0