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

Title: Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

Abstract

Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 10 5 processor cores.

Authors:
 [1];  [2]
  1. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
  2. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1340692
Report Number(s):
SAND-2017-0631J
Journal ID: ISSN 0029-5639; 650592; TRN: US1701199
Grant/Contract Number:  
AC04-94AL85000
Resource Type:
Accepted Manuscript
Journal Name:
Nuclear Science and Engineering
Additional Journal Information:
Journal Volume: 185; Journal Issue: 1; Journal ID: ISSN 0029-5639
Publisher:
American Nuclear Society
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; transport sweeps; parallel transport; domain overloading

Citation Formats

Pautz, Shawn D., and Bailey, Teresa S. Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions. United States: N. p., 2016. Web. doi:10.13182/nse16-34.
Pautz, Shawn D., & Bailey, Teresa S. Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions. United States. doi:10.13182/nse16-34.
Pautz, Shawn D., and Bailey, Teresa S. Tue . "Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions". United States. doi:10.13182/nse16-34. https://www.osti.gov/servlets/purl/1340692.
@article{osti_1340692,
title = {Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions},
author = {Pautz, Shawn D. and Bailey, Teresa S.},
abstractNote = {Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 105 processor cores.},
doi = {10.13182/nse16-34},
journal = {Nuclear Science and Engineering},
number = 1,
volume = 185,
place = {United States},
year = {2016},
month = {11}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Citation Metrics:
Cited by: 1 work
Citation information provided by
Web of Science

Save / Share:

Works referenced in this record:

An Algorithm for Parallel S n Sweeps on Unstructured Meshes
journal, February 2002

  • Pautz, Shawn D.
  • Nuclear Science and Engineering, Vol. 140, Issue 2
  • DOI: 10.13182/NSE02-1

An S n Algorithm for the Massively Parallel CM-200 Computer
journal, March 1998

  • Baker, Randal S.; Koch, Kenneth R.
  • Nuclear Science and Engineering, Vol. 128, Issue 3
  • DOI: 10.13182/NSE98-1