Studying the Efficiency of the Parallel Algorithm for Solving the Eigenvalue Problem Implemented in the LUCKY-A Computer Code

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 br...

Full description

Saved in:
Bibliographic Details
Published inPhysics of atomic nuclei Vol. 81; no. 8; pp. 1199 - 1203
Main Authors Egorov, A. L., Moryakov, A. V., Raskach, K. F.
Format Journal Article
LanguageEnglish
Published Moscow Pleiades Publishing 01.12.2018
Springer
Springer Nature B.V
Subjects
Algorithms
Analysis
Computing time
Data exchange
Efficiency
Eigenvalues
Fast breeder
Libraries
Matrix
Model testing
Multiprocessing
Particle and Nuclear Physics
Physics
Physics and Astronomy
Supercomputers
P
supercomputer
approximation
basic solution
S
solution
iterative process
program
parallel process efficiency
transport equation
space subdomain
algorithm
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1063-7788
1562-692X
DOI:10.1134/S1063778818080069