Academic Journal
An Asynchronous Many-Task Algorithm for Unstructured SN Transport on Shared Memory Systems.
| Τίτλος: | An Asynchronous Many-Task Algorithm for Unstructured S |
|---|---|
| Συγγραφείς: | Elwood, Alex1 (AUTHOR) alex.elwood@bristol.ac.uk, Deakin, Tom1 (AUTHOR), Lovegrove, Justin2 (AUTHOR), Nelson, Chris3 (AUTHOR) |
| Πηγή: | Journal of Computational & Theoretical Transport. 2026, Vol. 55 Issue 4, p311-334. 24p. |
| Θεματικοί όροι: | *Parallel programming, *Multicore processors, *Neutron transport theory, *Numerical calculations, *Multiprocessors |
| Περίληψη: | 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] |
| Βάση Δεδομένων: | Academic Search Index |
καταχωρήστε σχόλιο πρώτοι!