## An S _{N} Algorithm for Modern Architectures

## Abstract

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.

- Authors:

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

- Publication Date:

- Research Org.:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

- Sponsoring Org.:
- USDOE National Nuclear Security Administration (NNSA)

- OSTI Identifier:
- 1312619

- Report Number(s):
- LA-UR-16-26593

- Grant/Contract Number:
- AC52-06NA25396

- Resource Type:
- Accepted Manuscript

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 97 MATHEMATICS AND COMPUTING

### Citation Formats

```
Baker, Randal Scott. An SN Algorithm for Modern Architectures. United States: N. p., 2016.
Web. doi:10.2172/1312619.
```

```
Baker, Randal Scott. An SN Algorithm for Modern Architectures. United States. doi:10.2172/1312619.
```

```
Baker, Randal Scott. Mon .
"An SN Algorithm for Modern Architectures". United States. doi:10.2172/1312619. https://www.osti.gov/servlets/purl/1312619.
```

```
@article{osti_1312619,
```

title = {An SN Algorithm for Modern Architectures},

author = {Baker, Randal Scott},

abstractNote = {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.},

doi = {10.2172/1312619},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2016},

month = {8}

}

Other availability

Save to My Library

You must Sign In or Create an Account in order to save documents to your library.