Studying the Efficiency of the Parallel Algorithm for Solving the Eigenvalue Problem Implemented in the LUCKY-A Computer Code
- Autores: Egorov A.L.1, Moryakov A.V.1, Raskach K.F.2
-
Afiliações:
- National Research Center Kurchatov Institute
- AO Leipunskii Institute for Physics and Power Engineering
- Edição: Volume 81, Nº 8 (2018)
- Páginas: 1199-1203
- Seção: Article
- URL: https://journals.rcsi.science/1063-7788/article/view/193598
- DOI: https://doi.org/10.1134/S1063778818080069
- ID: 193598
Citar
Resumo
The efficiency of a parallel algorithm for solving the eigenvalue problem implemented in the LUCKY-A computer code is studied. The parallel algorithm is developed for application on supercomputers using the MPI standard of data exchange between parallel processes. The test problem–model of a fast breeder–is studied with the use of the library of 21-group cross sections. Results of solving this problem obtained by the LUCKY-A, TORT, and MMKKENO computer codes are presented. The efficiency of the parallel algorithm is determined as a function of the number of space subdomains in the computational domain.
Sobre autores
A. Egorov
National Research Center Kurchatov Institute
Autor responsável pela correspondência
Email: Egorov_AL@nrcki.ru
Rússia, Moscow, 123182
A. Moryakov
National Research Center Kurchatov Institute
Email: Egorov_AL@nrcki.ru
Rússia, Moscow, 123182
K. Raskach
AO Leipunskii Institute for Physics and Power Engineering
Email: Egorov_AL@nrcki.ru
Rússia, Obninsk, Kaluga oblast, 249033
Arquivos suplementares
