Email this article Studying the Efficiency of the Parallel Algorithm for Solving the Eigenvalue Problem Implemented in the LUCKY-A Computer Code
- Authors: Egorov A.L.1, Moryakov A.V.1, Raskach K.F.2
-
Affiliations:
- National Research Center Kurchatov Institute
- AO Leipunskii Institute for Physics and Power Engineering
- Issue: Vol 81, No 8 (2018)
- Pages: 1199-1203
- Section: Article
- URL: https://journals.rcsi.science/1063-7788/article/view/193598
- DOI: https://doi.org/10.1134/S1063778818080069
- ID: 193598
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. L. Egorov
National Research Center Kurchatov Institute
Author for correspondence.
Email: Egorov_AL@nrcki.ru
Russian Federation, Moscow, 123182
A. V. Moryakov
National Research Center Kurchatov Institute
Email: Egorov_AL@nrcki.ru
Russian Federation, Moscow, 123182
K. F. Raskach
AO Leipunskii Institute for Physics and Power Engineering
Email: Egorov_AL@nrcki.ru
Russian Federation, Obninsk, Kaluga oblast, 249033
Supplementary files
