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

Title: Domain Decomposition Solver Strategies for Future Platforms.


Abstract not provided.

Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Proposed for presentation at the JOWOG 34 ACS Meeting held February 2-5, 2015 in Albuquerque, New Mexico, U.S.A..
Country of Publication:
United States

Citation Formats

Dohrmann, Clark R. Domain Decomposition Solver Strategies for Future Platforms.. United States: N. p., 2015. Web.
Dohrmann, Clark R. Domain Decomposition Solver Strategies for Future Platforms.. United States.
Dohrmann, Clark R. 2015. "Domain Decomposition Solver Strategies for Future Platforms.". United States. doi:.
title = {Domain Decomposition Solver Strategies for Future Platforms.},
author = {Dohrmann, Clark R.},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2015,
month = 1

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:
  • Abstract not provided.
  • A method for a fast solution of the Poisson equation on irregular regions is proposed. The method, which may be called the Boundary Integral-based Domain Decomposition (BIDD) method, seems to be particularly efficient for parallel processing of large scale boundary value problems. For instance, in a hierachical multiprocessor system like the Cedar architecture, each cluster and each processor of a cluster can solve an independent subproblem resulting from the BIDD approach. 13 refs.
  • The effect of three communication schemes for solving Arbitrarily High Order Transport (AHOT) methods of the Nodal type on parallel performance is examined via direct measurements and performance models. The target architecture in this study is Oak Ridge National Laboratory`s 128 node Paragon XP/S 5 computer and the parallelization is based on the Parallel Virtual Machine (PVM) library. However, the conclusions reached can be easily generalized to a large class of message passing platforms and communication software. The three schemes considered here are: (1) PVM`s global operations (broadcast and reduce) which utilizes the Paragon`s native corresponding operations based on amore » spanning tree routing; (2) the Bucket algorithm wherein the angular domain decomposition of the mesh sweep is complemented with a spatial domain decomposition of the accumulation process of the scalar flux from the angular flux and the convergence test; (3) a distributed memory version of the Bucket algorithm that pushes the spatial domain decomposition one step farther by actually distributing the fixed source and flux iterates over the memories of the participating processes. Their conclusion is that the Bucket algorithm is the most efficient of the three if all participating processes have sufficient memories to hold the entire problem arrays. Otherwise, the third scheme becomes necessary at an additional cost to speedup and parallel efficiency that is quantifiable via the parallel performance model.« less
  • Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verifymore » the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)« less
  • This report describes the implementation of a coupled mechanical /heat transfer simulation using a Finite Element Interface (FEI). The FE1 is an abstraction layer, which lies between the application code and its linear solver libraries, controlling the set-up and solution of the linear system arising in the finite element simulation. The performance and scalability of the ISIS++ FE1 is examined on the ASCI Red and Blue machines in the context of the ALE3D finite element simulation code.