We present performance results obtained on a 128-node Cray Research T3D computer by a neutron transport code implementing a standard mtiltigroup, discrete ordinates algorithm on a three-dimensional Cartesian grid. After summarizing the implementation strategy used to obtain a full decomposition of phase space (i.e., simultaneous parallelization of the neutron energy, directional and spatial variables), we investigate the scalability of the fundamental source iteration step with respect to each phase space variable. We also describe enhancements that have enabled performance rates approaching 10 gigaflops on the full 128-node machine
The response matrix method offers an excellent vehicle for adapting three-dimensional neutron transp...
Performance evaluation for neutron transport application using message passing -- Parallel solver ba...
The coarse mesh finite difference (CMFD) method is applied to the discontinuous finite element metho...
Scalable parallel algorithm for particle transport is one of the main application fields in high-per...
The computing power available nowadays to the average Monte-Carlo-code user is sufficient to perform...
The VARIANT code solves the multigroup steady-state neutron diffusion and transport equation in thre...
The main goal of this work is to examine efficient methods for solving neutron transport and diffusi...
We present the newly developed time-dependent 3D multigroup discrete ordinates neutron transport sol...
The spatial heterogeneity of the next generation Gen-IV nuclear reactor core designs brings challeng...
High-fidelity nuclear reactor core simulations require a precise knowledge of the neutron flux insid...
Neutron transport codes are essential tools in nuclear reactor and shielding design. Transport codes...
Two programming models for parallelizing the Angular Domain Decomposition (ADD) of the discrete ordi...
The PIDOTS neutral particle transport code utilizes a red/black implementation of the Parallel Gauss...
In this companion paper to “Algorithmic Choices in WARP – A Framework for Continuous Energy Monte Ca...
Neutron transport codes are essential tools in nuclear reactor and shielding design. Transport codes...
The response matrix method offers an excellent vehicle for adapting three-dimensional neutron transp...
Performance evaluation for neutron transport application using message passing -- Parallel solver ba...
The coarse mesh finite difference (CMFD) method is applied to the discontinuous finite element metho...
Scalable parallel algorithm for particle transport is one of the main application fields in high-per...
The computing power available nowadays to the average Monte-Carlo-code user is sufficient to perform...
The VARIANT code solves the multigroup steady-state neutron diffusion and transport equation in thre...
The main goal of this work is to examine efficient methods for solving neutron transport and diffusi...
We present the newly developed time-dependent 3D multigroup discrete ordinates neutron transport sol...
The spatial heterogeneity of the next generation Gen-IV nuclear reactor core designs brings challeng...
High-fidelity nuclear reactor core simulations require a precise knowledge of the neutron flux insid...
Neutron transport codes are essential tools in nuclear reactor and shielding design. Transport codes...
Two programming models for parallelizing the Angular Domain Decomposition (ADD) of the discrete ordi...
The PIDOTS neutral particle transport code utilizes a red/black implementation of the Parallel Gauss...
In this companion paper to “Algorithmic Choices in WARP – A Framework for Continuous Energy Monte Ca...
Neutron transport codes are essential tools in nuclear reactor and shielding design. Transport codes...
The response matrix method offers an excellent vehicle for adapting three-dimensional neutron transp...
Performance evaluation for neutron transport application using message passing -- Parallel solver ba...
The coarse mesh finite difference (CMFD) method is applied to the discontinuous finite element metho...