首页> 外文会议>Mathematics and Computations, Supercomputing in Nuclear Applications and Monte Carlo International Conference >HIERARCHICAL GEOMETRY TREE-BASED METHOD FOR SCORING MASSIVE TALLIES IN MONTE CARLO PARTICLE TRANSPORT CALCULATION
【24h】

HIERARCHICAL GEOMETRY TREE-BASED METHOD FOR SCORING MASSIVE TALLIES IN MONTE CARLO PARTICLE TRANSPORT CALCULATION

机译:基于分层几何树的蒙特卡罗粒子运输计算中的巨大势树的分层方法

获取原文

摘要

Monte Carlo codes that use a linear search to determine which tally bins need to be scored in each tracking step suffer severe performance penalties when tallying a large number of quantities. This paper proposed a new tally method based on the hierarchical geometry tree. This method determines where to store the tally contribution by tracking down the tree. For the same reactor model, the average active cycle execution time of tallying 6 million fuel pin segments increased about 4% compared with inactive cycles. This method has been implemented in the CAD-based Monte Carlo code SuperMC.
机译:使用线性搜索的蒙特卡罗代码,以确定在每个跟踪步骤中需要在每个跟踪步骤中得分的计时垃圾箱在统计大量数量时遭受严重的性能惩罚。本文提出了一种基于分层几何树的新作业方法。此方法通过跟踪树来确定存储Tally贡献的位置。对于相同的反应堆模型,与非活动循环相比,将600万燃料销段的平均活动循环执行时间增加约4%。此方法已在CAD的蒙特卡罗代码SUPERMC中实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号