计算物理 ›› 2022, Vol. 39 ›› Issue (2): 143-152.DOI: 10.19596/j.cnki.1001-246x.8381

• 研究论文 • 上一篇    下一篇

二维球坐标系中子输运方程的一种并行SN算法

蔡颖1(), 张存波1, 刘旭2,3,*(), 范征锋1,4, 刘元元1, 徐小文2,3, 张爱清2,3   

  1. 1. 北京应用物理与计算数学研究所, 北京 100094
    2. 北京应用物理与计算数学研究所, 计算物理重点实验室, 北京 100088
    3. 中物院高性能数值模拟软件中心, 北京 100088
    4. 北京大学应用物理与技术研究中心, 高能量密度物理数值模拟 教育部重点实验室, 北京 100871
  • 收稿日期:2021-04-19 出版日期:2022-03-25 发布日期:2022-06-24
  • 通讯作者: 刘旭
  • 作者简介:

    蔡颖,女,博士,助理研究员,研究方向为高性能计算,E-mail:

  • 基金资助:
    科技部重点研发计划高性能计算重点专项(2017YFB0202103); 科学挑战专题(TZ2019-B1)

A Parallel SN Method for Neutron Transport Equation in 2-D Spherical Coordinate

Ying CAI1(), Cunbo ZHANG1, Xu LIU2,3,*(), Zhengfeng FAN1,4, Yuanyuan LIU1, Xiaowen XU2,3, Aiqing ZHANG2,3   

  1. 1. Institute of Applied Physics and Computational Mathematics, Beijing 100094, China
    2. Laboratory of Computational Physics, Institute of Applied Physics and Computational Mathematics, Beijing 100088, China
    3. CAEP Software Center for High Performance Numerical Simulation, Beijing 100088, China
    4. HEDPS, Center for Applied Physics and Technology, Peking University, Beijing 100871, China
  • Received:2021-04-19 Online:2022-03-25 Published:2022-06-24
  • Contact: Xu LIU

摘要:

针对二维球坐标系下中子输运方程的SN算法, 提出基于(单元, 方向)二元组的有向图模型, 在已有的基于有向图的并行流水线算法基础上, 设计粒度可控多级并行SN算法。其中, 采用区域分解和并行流水线相结合的方式挖掘空间-角度方向的并行度, 提出能群流水并行方法, 并通过设置合适的流水线粒度来平衡有向图调度、通信和空闲等待开销。实验结果表明: 该算法可以有效地求解二维球坐标系下的中子输运方程。在某国产并行机1920核上, 对于96万网格、60个方向、24能群、数十亿自由度的典型中子输运问题, 获得了71%的并行效率。

关键词: 中子输运方程, 源迭代SN算法, 有向图, 并行算法

Abstract:

Targeting at SN algorithm for the neutron transport equation in the two-dimensional spherical coordinate system, we propose a directed graph model based on a (cell, direction) two-tuple, and design a multi-level parallel SN algorithm with controllable granularity on the basis of the existing parallel pipeline algorithm based on directed graph. Among them, a combination of domain decomposition and parallel pipeline is used to mine parallelism in the space-angle direction, and an energy group pipeline parallel method is proposed. Furthermore, by setting appropriate pipeline granularity, the overhead of scheduling, communication and idle waiting are well balanced. Experimental results show that the algorithm can effectively solve the neutron transport equation in the two-dimensional spherical coordinate system. For a typical neutron transport problem with 960 000 grids, 60 directions, 24 energy groups, and billions of degrees of freedom, the parallel program achieved 71% parallel efficiency on 1920 cores of a domestic parallel machine.

Key words: neutron transport equation, source iteration SN algorithm, directed graph, parallel computing