National Technical Reports Library

The National Technical Information Service acquires, indexes, abstracts, and archives the largest collection of U.S. government-sponsored technical reports in existence. The NTRL offers online, free and open access to these authenticated government technical reports. Technical reports and documents in its repository may be available online for free either from the issuing federal agency, the U.S. Government Publishing Office’s Federal Digital System website, or through search engines.

Details

Algorithm for parallel sn sweeps on unstructured meshes.

DE2001772846

Publication Date	2000
Personal Author	Pautz, S. D.
Page Count	27
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.
Keywords	Mesh generation Algorithms Efficiency Lanl Parallel processing
Source Agency	Technical Information Center Oak Ridge Tennessee
NTIS Subject Category	72B - Algebra, Analysis, Geometry, & Mathematical Logic
Corporate Authors	Los Alamos National Lab., NM.; Department of Energy, Washington, DC.
Document Type	Conference Proceedings
NTIS Issue Number	200125
Contract Number	W-7405-ENG-36

Algorithm for parallel sn sweeps on unstructured meshes.

Algorithm for parallel sn sweeps on unstructured meshes.
DE2001772846

Publication Date	2000
Personal Author	Pautz, S. D.
Page Count	27
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.
Keywords	Mesh generation Algorithms Efficiency Lanl Parallel processing
Source Agency	Technical Information Center Oak Ridge Tennessee
NTIS Subject Category	72B - Algebra, Analysis, Geometry, & Mathematical Logic
Corporate Authors	Los Alamos National Lab., NM.; Department of Energy, Washington, DC.
Document Type	Conference Proceedings
NTIS Issue Number	200125
Contract Number	W-7405-ENG-36