基于最近邻域算法的蒙卡负载均衡实现  

Implementation of Monte Carlo Load Balancing Based on Nearest Neighbor Algorithm

作　　者：崔显涛 强胜龙 匡邓晖 尹强[1] 张文鑫 刘远 吴斌[1] Cui Xiantao;Qiang Shenglong;Kuang Denghui;Yin Qiang;Zhang Wenxin;Liu Yuan;Wu Bin(Science and Technology on Reactor System Design Technology Laboratory,Nuclear Power Institute of China,Chengdu,610213,China;National University of Defense Technology,Changsha,410073,China)

机构地区：[1]中国核动力研究设计院核反应堆系统设计技术重点实验室,成都610213 [2]国防科技大学,长沙410073

出　　处：《核动力工程》2021年第S02期37-40,共4页Nuclear Power Engineering

摘　　要：为解决蒙特卡罗程序(蒙卡程序)由于迭代后期导致的粒子负载不均衡,从而引起程序并行效率低下的问题,通过分析不同算法的优劣,在蒙特卡罗计算辅助工具包(MOI)蒙卡程序上采用了最近邻域算法实现了负载均衡技术。通过千万网格算例对其进行测试,算法降低了至少10%计算时间,且随着燃耗加深,计算时间会进一步降低。结果表明:最近邻域算法针对粒子负载不均衡问题具有较好的效果。In order to solve the problem of low parallelism caused by particle load imbalance of Monte Carlo program at the end of iteration,this paper analyzes the advantages and disadvantages of different algorithms,and the nearest neighbor algorithm is used on MOI Monte Carlo program to solve load balancing.Finally,we adapt an example of ten million grid to test this algorithm,it reduces the computation time by at least 10%,and as the burnup deepens,the calculation time will decrease even further.The results show that the algorithm is effective for the problem of particle load imbalance.

关 键 词：最近邻域算法 负载不均衡 MOI蒙卡程序 并行 

分 类 号：F416.23[经济管理—产业经济]