Iterative Schemes for ParallelSnAlgorithms in a Shared-Memory Computing Environment
- 1 September 1995
- journal article
- research article
- Published by Taylor & Francis in Nuclear Science and Engineering
- Vol. 121 (1) , 103-113
- https://doi.org/10.13182/nse95-a24132
Abstract
Several two-dimensional spatial domain partitioning Sn transport theory algorithms are developed on the basis of different iterative schemes. These algorithms are incorporated into TWOTRAN-II and tested on the shared-memory CRAY Y-MP C90 computer. For a series of fixed-source r-z geometry homogeneous problems, it is demonstrated that the concurrent red-black algorithms may result in large parallel efficiencies (>60%) on C90. It is also demonstrated that for a realistic shielding problem, the use of the negative flux fixup causes high load imbalance, which results in a significant loss of parallel efficiency.Keywords
This publication has 5 references indexed in Scilit:
- Spatial and angular domain decomposition algorithms for the curvilinear SNtransport theory methodTransport Theory and Statistical Physics, 1993
- Performance and performance modeling of a parallel algorithm for solving the neutron transport equationThe Journal of Supercomputing, 1992
- Domain Decomposition of a Two-DimensionalSnMethodNuclear Science and Engineering, 1992
- Parallel SnIteration SchemesNuclear Science and Engineering, 1985
- TWOTRAN-II: an interfaced, exportable version of the TWOTRAN code for two- dimensional transportPublished by Office of Scientific and Technical Information (OSTI) ,1973