{"ID":2856413,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.11513","arxiv_id":"2510.11513","title":"An Asynchronous Many-Task Algorithm for Unstructured $S_{N}$ Transport on Shared Memory Systems","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.","short_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 mode...","url_abs":"https://arxiv.org/abs/2510.11513","url_pdf":"https://arxiv.org/pdf/2510.11513v1","authors":"[\"Alex Elwood\",\"Tom Deakin\",\"Justin Lovegrove\",\"Chris Nelson\"]","published":"2025-10-13T15:21:12Z","proceeding":"cs.DC","tasks":"[\"cs.DC\"]","methods":"[]","has_code":false}