An optimized algorithm for solving the nodal diffusion method on shared memory multiprocessors
Nodal methods play a special role in reactor physics calculations. In recent papers the high computational efficiency of nodal methods has been established and the development of more efficient algorithms tailored to the advanced architectures of modern day computers proposed. The rapidly changing architectures of today's computer influence the way codes have to be programmed so that reasonable speed up and efficiency are attained. We have applied these concepts in solving the one-group neutron diffusion equation in two-dimensional geometry on parallel computers like the Intel iPSC/2 hypercube and the Sequent Balance 8000. The efficiency of the hypercube for the neutron diffusion equation is highly determined by the message passing scheme; on the other hand, on a shared memory processor like the Sequent, it is dependent on the manipulation of variables in shared memory. In this paper, we present a scheme on shared memory processors which produces very high computing efficiencies in agreement with Amdahl's law. 6 refs., 1 fig.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- Sponsoring Organization:
- DOE/NE
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 5130026
- Report Number(s):
- CONF-900343-1; ON: DE90002703
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance modeling of parallel algorithms for solving neutron diffusion problems
A new communication scheme for the neutron diffusion nodal method in a distributed computing environment
Related Subjects
220100* -- Nuclear Reactor Technology-- Theory & Calculation
99 GENERAL AND MISCELLANEOUS
990200 -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTERS
DIFFERENTIAL EQUATIONS
EQUATIONS
HYPERCUBE COMPUTERS
MATHEMATICAL LOGIC
NEUTRON DIFFUSION EQUATION
NUMERICAL SOLUTION
OPTIMIZATION