Performance modeling of parallel algorithms for solving neutron diffusion problems
- Oak Ridge National Lab., TN (United States). Engineering Physics and Mathematics Div.
Neutron diffusion calculations are the most common computational methods used in the design, analysis, and operation of nuclear reactors and related activities. Here, mathematical performance models are developed for the parallel algorithm used to solve the neutron diffusion equation on message passing and shared memory multiprocessors represented by the Intel iPSC/860 and the Sequent Balance 8000, respectively. The performance models are validated through several test problems, and these models are used to estimate the performance of each of the two considered architectures in situations typical of practical applications, such as fine meshes and a large number of participating processors. While message passing computers are capable of producing speedup, the parallel efficiency deteriorates rapidly as the number of processors increases. Furthermore, the speedup fails to improve appreciably for massively parallel computers so that only small- to medium-sized message passing multiprocessors offer a reasonable platform for this algorithm. In contrast, the performance model for the shared memory architecture predicts very high efficiency over a wide range of number of processors reasonable for this architecture. Furthermore, the model efficiency of the Sequent remains superior to that of the hypercube if its model parameters are adjusted to make its processors as fast as those of the iPSC/860. It is concluded that shared memory computers are better suited for this parallel algorithm than message passing computers.
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 79440
- Journal Information:
- Nuclear Science and Engineering, Vol. 120, Issue 1; Other Information: PBD: May 1995
- Country of Publication:
- United States
- Language:
- English
Similar Records
An optimized algorithm for solving the nodal diffusion method on shared memory multiprocessors
Parallel solution of sparse algebraic equations