An Algorithm for Parallel Sn Sweeps on Unstructured Meshes
- 1 February 2002
- journal article
- research article
- Published by Taylor & Francis in Nuclear Science and Engineering
- Vol. 140 (2) , 111-136
- https://doi.org/10.13182/nse02-1
Abstract
A new algorithm for performing parallel Sn 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 Sn methods.Keywords
This publication has 6 references indexed in Scilit:
- Discontinuous Finite ElementSNMethods on Three-Dimensional Unstructured GridsNuclear Science and Engineering, 2001
- Benchmarking and Comparison of the Task Graph Scheduling AlgorithmsJournal of Parallel and Distributed Computing, 1999
- AnSnAlgorithm for the Massively Parallel CM-200 ComputerNuclear Science and Engineering, 1998
- Multiprocessing for neutron diffusion and deterministic transport methodsProgress in Nuclear Energy, 1997
- DSC: scheduling parallel tasks on an unbounded number of processorsIEEE Transactions on Parallel and Distributed Systems, 1994
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessorsJournal of Parallel and Distributed Computing, 1992