PARALLELIZATION IN COMPUTATIONAL DOMAINS IN SATURN-3 CODES FOR 2D TRANSPORT PROBLEMS

M.E. Lebedeva, S.P. Santalov, S.V. Subbot
VANT. Ser.: Mat. Mod. Fiz. Proc 2000. Вып.4. С. 58-60.

An algorithm is described for parallelization in computational domains for 2D transport problems. The efficiency of this algorithm is studied using computations performed on multi-processors with distributed memory.
    The algorithm is derived from the principle of geometrical decomposition of the original domain in subdomains and performance of separate computations by subdomains; mathematical (computational) domains are chosen for the latter. Computational domains exchange boundary conditions. Iterations by boundary conditions are combined with iterations by right-hand side of the transport equation.
    MPI protocol is chosen for exchanging messages between processors. The use of standard functions of synchronous and asynchronous transmissions allows transferring easily programs on different platforms of translators and operating systems, supporting MPI.