Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Coarse-grain parallel solution of few-group neutron diffusion equations

Conference · · Transactions of the American Nuclear Society; (United States)
OSTI ID:5764713
;  [1]
  1. North Carolina State Univ., Raleigh (United States)
The authors present a parallel numerical algorithm for the solution of the finite difference representation of the few-group neutron diffusion equations. The targeted architectures are multiprocessor computers with shared memory like the Cray Y-MP and the IBM 3090/VF, where coarse granularity is important for minimizing overhead. Most of the work done in the past, which attempts to exploit concurrence, has concentrated on the inner iterations of the standard outer-inner iterative strategy. This produces very fine granularity. To coarsen granularity, the authors introduce parallelism at the nested outer-inner level. The problem's spatial domain was partitioned into contiguous subregions and assigned a processor to solve for each subregion independent of all other subregions, hence, processors; i.e., each subregion is treated as a reactor core with imposed boundary conditions. Since those boundary conditions on interior surfaces, referred to as internal boundary conditions (IBCs), are not known, a third iterative level, the recomposition iterations, is introduced to communicate results between subregions.
OSTI ID:
5764713
Report Number(s):
CONF-910603--
Conference Information:
Journal Name: Transactions of the American Nuclear Society; (United States) Journal Volume: 63
Country of Publication:
United States
Language:
English