Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 105 processor cores.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- Grant/Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1340692
- Report Number(s):
- SAND-2017-0631J; 650592; TRN: US1701199
- Journal Information:
- Nuclear Science and Engineering, Vol. 185, Issue 1; ISSN 0029-5639
- Publisher:
- American Nuclear SocietyCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
An Algorithm for Parallel S n Sweeps on Unstructured Meshes
|
journal | February 2002 |
An S n Algorithm for the Massively Parallel CM-200 Computer
|
journal | March 1998 |
A novel transport sweep architecture for efficient deterministic patient dose calculations in MRI-guided radiotherapy
|
journal | September 2019 |
| An Efficient Sweep-based Solver for the $S_{N}$ Equations on High-Order Meshes | preprint | January 2018 |
| Parallel Approximate Ideal Restriction Multigrid for Solving the S$_N$ Transport Equations | preprint | January 2019 |
Similar Records
AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES
AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES