NUMERICAL STUDY OF PARALLELIZATION ALGORITHMS FOR 3-D NEUTRON DIFFUSION AND TRANSPORT CALCULATION WITH SATURN COMPLEX ON MULTIPROCESSORS

A.V. Alekseev, I.D. Sofronov, L.P. Fedotova, R.M. Shagaliev
VANT. Ser.: Mat. Mod. Fiz. Proc 1997. Вып.1. С. 38-39.

      This work considers the parallelization algorithms for 3-D group neutron diffusion and transport calculations on distributed memory multiprocessors. These algorithms are implemented in SATURN complex intended for 3-D stationary and nonstationary neutron-nuclei interaction calculations and for neutron transport in group diffusion kinetic approximation.
      The parallelization algorithm for diffusion equation rests on splitting the system into subdomains using the iterative process for special type internal boundary conditions ensuring unconditional process convergence.
      The parallelization algorithm for transport equation is iteration-free and uses the pipeline type scheme with sequential loading of processors.
      The testing results for parallelization algorithms are given obtained on the domestic 8-processor MP-3 system and on western distributed-memory multiprocessors (up to 256 PEs) Cray T3D and IBM SP2.