skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES

Abstract

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.

Authors:
Publication Date:
Research Org.:
Los Alamos National Lab., NM (US)
Sponsoring Org.:
US Department of Energy (US)
OSTI Identifier:
772846
Report Number(s):
LA-UR-00-5993
TRN: AH200129%%202
DOE Contract Number:  
W-7405-ENG-36
Resource Type:
Conference
Resource Relation:
Conference: Conference title not supplied, Conference location not supplied, Conference dates not supplied; Other Information: PBD: 1 Dec 2000
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; EFFICIENCY; LANL

Citation Formats

S. D. PAUTZ. AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES. United States: N. p., 2000. Web.
S. D. PAUTZ. AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES. United States.
S. D. PAUTZ. Fri . "AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES". United States. https://www.osti.gov/servlets/purl/772846.
@article{osti_772846,
title = {AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES},
author = {S. D. PAUTZ},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2000},
month = {12}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: