Actions for AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES [electronic resource].

Email RIS file
Bookmark
Report an Issue

AN ALGORITHM FOR PARALLEL SN SWEEPS ON UNSTRUCTURED MESHES [electronic resource].

Published
Washington, D.C. : United States. Dept. of Energy, 2000.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
Physical Description
4,100 Kilobytes pages : digital, PDF file
Additional Creators
Los Alamos National Laboratory, United States. Department of Energy, and United States. Department of Energy. Office of Scientific and Technical Information
Access Online

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Free-to-read Unrestricted online access
Summary
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 (≤100) levels of parallelism. This work is a fundamental step in the development of parallel S{sub n} methods.
Report Numbers
E 1.99:la-ur-00-5993
la-ur-00-5993
Subject(s)
Other Subject(s)
Note
Published through SciTech Connect.
12/01/2000.
"la-ur-00-5993"
Conference title not supplied, Conference location not supplied, Conference dates not supplied.
S. D. PAUTZ.
Funding Information
W-7405-ENG-36
View MARC record | catkey: 14344113