AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES

Conference · Thu Mar 01 00:00:00 EST 2001

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

PAUTZ, S D

We develop a new algorithm for performing parallel S{sub n} sweeps on unstructured meshes. 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 we have observed nearly linear speedups on up to 126 processors. This is an important and desirable result, since although analyses of structured meshes indicate that parallel sweeps will not scale with normal partitioning approaches, we do not observe any severe asymptotic degradation in the parallel efficiency with modest ({le} 100) levels of parallelism. This work is a fundamental step in the development of parallel S{sub n} methods.

• Research Organization: Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
• Sponsoring Organization: US Department of Energy (US)
• DOE Contract Number: W-7405-ENG-36
• OSTI ID: 776172
• Report Number(s): LA-UR-01-1420; TRN: AH200124%%62
• Resource Relation: Journal Volume: 140; Journal Issue: 2; Conference: Conference title not supplied, Conference location not supplied, Conference dates not supplied; Other Information: PBD: 1 Mar 2001
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ALGORITHMS
EFFICIENCY
MESH GENERATION
PARALLEL PROCESSING