Performance of a parallel algorithm for solving the neutron diffusion equation on the hypercube
The one-group, steady state neutron diffusion equation in two- dimensional Cartesian geometry is solved using the nodal method technique. By decoupling sets of equations representing the neutron current continuity along the length of rows and columns of computational cells a new iterative algorithm is derived that is more suitable to solving large practical problems. This algorithm is highly parallelizable and is implemented on the Intel iPSC/2 hypercube in three versions which differ essentially in the total size of communicated data. Even though speedup was achieved, the efficiency is very low when many processors are used leading to the conclusion that the hypercube is not as well suited for this algorithm as shared memory machines. 10 refs., 1 fig., 3 tabs.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 5937739
- Report Number(s):
- CONF-890844-1; ON: DE89006128
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance modeling of parallel algorithms for solving neutron diffusion problems
A parallel approach to the nodal method solution of the two-dimensional diffusion equation
Related Subjects
Shielding Calculations & Experiments
73 NUCLEAR PHYSICS AND RADIATION PHYSICS
99 GENERAL AND MISCELLANEOUS
990210 -- Supercomputers-- (1987-1989)
ALGORITHMS
COMPUTERS
DIFFERENTIAL EQUATIONS
EQUATIONS
HYPERCUBE COMPUTERS
ITERATIVE METHODS
MATHEMATICAL LOGIC
NEUTRON DIFFUSION EQUATION
NUMERICAL SOLUTION
PARALLEL PROCESSING
PERFORMANCE TESTING
PROGRAMMING
TESTING