本文基于网格区域剖分，提出了一种新的非结构网格粒子输运Sn并行算法，实现了多个角方向和多个能群的同时计算，在计算的过程中不用进行优先级计算和优先级队列维护，只需要按照计算队列的次序组织并行计算。综合考虑所有方向和所有网格点的数据依赖关系，结合Blevel优先级，提出了一种优先级计算方法，优先计算需要数据发送的任务，延迟需要接收数据的任务，达到减少处理器等待时间和计算与通信重叠的目的。使用本文的Sn并行算法和优先级队列针对二维粒子输运问题进行的数值实验表明，并行算法具有良好的并行计算加速效果，扩展到1 024个处理机时，相对64个处理机的并行效率达到52％。

Based on the grid decompostion across processors,a new Sn parallel algorithm for particle transport on unstructured grids is presented. The algorithm implements parallel computation for different angle directions and energy groups,according to the orders of the computing queue. During the parallel computation,it is not necessary to compute the priorities and arrange the priority queues. Synthesizing the data dependence of all directions and all grids,and combining with the Blevel priority,a new priority ordering algorithm is presented. In order to overlap the computation and communication,the algorithm gives priority to computing the grids which need not receive the upstream grids’ messages. Using the Sn parallel algorithm and the priority ordering algorithm,we solve a two dimensional particle transport equations on a parallel computer.The performance results show the algorithms have good scalability. The parallel efficiency is 52% when the processor number is extended for 64 to 1024.