摘要
文章针对三角形非结构网格,在几何区域分解并行的基础上,利用Sn方法求解中子输运方程的源迭代过程中各方向的计算是独立的这一特点,考虑各方向扫描的并行性,设计了各方向同时扫描的并行流水线算法,并对一单群S8输运计算问题进行了验证。结果表明:当处理器个数为32时,加速比达23.57,并行效率为0.736。
Aiming at the triangle unstructured grid, based on the domain decomposition technique, a new direction parallel S. sweeping algorithm was developed with the utilization of the independence of different neutron flight directions during the S. sweeping process. It was verified with a mono-group S8 neutron transport calculation problem. The results show that when the CPU number is 32, the speedup ratio is 23.57, and the parallel efficiency is 0. 736.
出处
《原子能科学技术》
EI
CAS
CSCD
北大核心
2009年第1期62-66,共5页
Atomic Energy Science and Technology
基金
国家自然科学基金资助项目(10475064
10605017)
关键词
中子输运
非结构网格
并行计算
Sn方法
neutron transport
unstructured grid
parallel algorithm
Sn method
