关键词: 输运方程 并行Sn扫描算法 非结构网格

Abstract:

The scalable parallel algorithm for solving transport equations on unstructured grids is a desirable item. This paper is based on literature [1] about the parallel pipelined Sn sweeping algorithm, and presents an improved algorithm. The new algorithm can lead to less dependence of the original algorithm on the latency between processors, and reduce the communication time when the programs run. Therefore,the new algorithm can shorten the parallel exec ution time and improve the parallel performance, We solve a 2D particle transport equation on a parallel computer. The performance results show the para  llel speedup ratio takes on a linear increase when the processor number grows from 64 to 256 . The improved algorithm＇s parallel execution time decreasses by 19% compared with the old one.

Key words: transport equation, parallel Sn sweeping algorithms unstructured grid