.png){kind=icon}
.png){kind=icon}
Return
An Asynchronous Many-Task Algorithm for Unstructured SN Transport on Shared Memory Systems
.png){kind=icon}
PRE
AI
DOI：10.1080/23324309.2026.2641013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Discrete ordinates SN 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.
Keywords:
Neutral particle transport
Asynchronous Many-Task
Unstructured
Journal
J
IF:
1.1
Papers:
22
Citations:
0