An Asynchronous Many-Task Algorithm for Unstructured SN Transport on Shared Memory Systems.
Saved in:
| Title: | An Asynchronous Many-Task Algorithm for Unstructured S |
|---|---|
| Authors: | Elwood, Alex1 (AUTHOR) alex.elwood@bristol.ac.uk, Deakin, Tom1 (AUTHOR), Lovegrove, Justin2 (AUTHOR), Nelson, Chris3 (AUTHOR) |
| Source: | Journal of Computational & Theoretical Transport. 2026, Vol. 55 Issue 4, p311-334. 24p. |
| Subjects: | Parallel programming, Multicore processors, Neutron transport theory, Numerical calculations, Multiprocessors |
| Abstract: | Discrete ordinates S N transport solvers on unstructured meshes pose a challenge to scale due to complex data dependencies, memory access patterns and a high-dimensional domain. In this paper, we review the performance bottlenecks within the shared memory parallelization scheme of an existing transport solver on modern many-core architectures with high core counts. With this analysis, we then survey the performance of this solver across a variety of compute hardware. We then present a new Asynchronous Many-Task (AMT) algorithm for shared memory parallelism, present results showing an increase in computational performance over the existing method, and evaluate why performance is improved. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Computational & Theoretical Transport is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Discrete ordinates S N transport solvers on unstructured meshes pose a challenge to scale due to complex data dependencies, memory access patterns and a high-dimensional domain. In this paper, we review the performance bottlenecks within the shared memory parallelization scheme of an existing transport solver on modern many-core architectures with high core counts. With this analysis, we then survey the performance of this solver across a variety of compute hardware. We then present a new Asynchronous Many-Task (AMT) algorithm for shared memory parallelism, present results showing an increase in computational performance over the existing method, and evaluate why performance is improved. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 23324309 |
| DOI: | 10.1080/23324309.2026.2641013 |
