An S_N Algorithm for Modern Architectures

Journal Article · 29 August 2016

DOI: https://doi.org/10.2172/1312619 · OSTI ID:1312619

Baker, Randal Scott ^[1]

---

1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

LANL discrete ordinates transport packages are required to perform large, computationally intensive time-dependent calculations on massively parallel architectures, where even a single such calculation may need many months to complete. While KBA methods scale out well to very large numbers of compute nodes, we are limited by practical constraints on the number of such nodes we can actually apply to any given calculation. Instead, we describe a modified KBA algorithm that allows realization of the reductions in solution time offered by both the current, and future, architectural changes within a compute node.

• Research Organization: Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
• Sponsoring Organization: USDOE National Nuclear Security Administration (NNSA)
• Grant/Contract Number: AC52-06NA25396
• OSTI ID: 1312619
• Report Number(s): LA-UR-16-26593
• Country of Publication: United States
• Language: English