An Algorithm for Parallel S{sub n} Sweeps on Unstructured Meshes

Journal Article · Fri Feb 15 00:00:00 EST 2002 · Nuclear Science and Engineering

DOI:https://doi.org/10.13182/NSE02-1· OSTI ID:20804760

Pautz, Shawn D ^[1]

---

1. Los Alamos National Laboratory (United States)

A new algorithm for performing parallel S{sub n} sweeps on unstructured meshes is developed. The algorithm uses a low-complexity list ordering heuristic to determine a sweep ordering on any partitioned mesh. For typical problems and with 'normal' mesh partitionings, nearly linear speedups on up to 126 processors are observed. This is an important and desirable result, since although analyses of structured meshes indicate that parallel sweeps will not scale with normal partitioning approaches, no severe asymptotic degradation in the parallel efficiency is observed with modest ({<=}100) levels of parallelism. This result is a fundamental step in the development of efficient parallel S{sub n} methods.

• OSTI ID: 20804760
• Journal Information: Nuclear Science and Engineering, Vol. 140, Issue 2; Other Information: Copyright (c) 2006 American Nuclear Society (ANS), United States, All rights reserved. http://epubs.ans.org/; Country of input: International Atomic Energy Agency (IAEA); ISSN 0029-5639
• Country of Publication: United States
• Language: English

Related Subjects

73 NUCLEAR PHYSICS AND RADIATION PHYSICS
ALGORITHMS
CALCULATION METHODS
EFFICIENCY
RADIATION TRANSPORT
TRANSPORT THEORY