Implementation of a parallel algorithm for spherical S sub N calculations on the IBM 3090

Conference · Sun Jan 01 04:00:00 EST 1989 · Transactions of the American Nuclear Society; (USA)

OSTI ID:6504582

Haghighat, A ^[1]; Lawrence, R D

---

1. Pennsylvania State Univ., University Park (USA)

Parallel S{sub N} algorithms based on domain decomposition in angle are straightforward to develop in Cartesian geometry because the computation of the angular fluxes for a specific discrete ordinate can be performed independently of all other angles. This is not the case for curvilinear geometries, where the angular redistribution component of the discretized streaming operator results in coupling between angular fluxes along adjacent discrete ordinates. Previously, the authors developed a parallel algorithm for S{sub N} calculations in spherical geometry and examined its iterative convergence for criticality and detector problems with differing scattering/absorption ratios. In this paper, the authors describe the implementation of the algorithm on an IBM 3090 Model 400 (four processors) and present computational results illustrating the efficiency of the algorithm relative to serial execution.

• OSTI ID: 6504582
• Report Number(s): CONF-891103--
• Conference Information: Journal Name: Transactions of the American Nuclear Society; (USA) Journal Volume: 60
• Country of Publication: United States
• Language: English

Related Subjects

654003* -- Radiation & Shielding Physics-- Neutron Interactions with Matter
73 NUCLEAR PHYSICS AND RADIATION PHYSICS
ALGORITHMS
CARTESIAN COORDINATES
COMPUTER CALCULATIONS
COMPUTERS
COORDINATES
DISCRETE ORDINATE METHOD
EFFICIENCY
IBM COMPUTERS
IMPLEMENTATION
MATHEMATICAL LOGIC
MESH GENERATION
NEUTRON FLUX
NEUTRON TRANSPORT THEORY
ONE-DIMENSIONAL CALCULATIONS
PARALLEL PROCESSING
PROGRAMMING
RADIATION FLUX
TRANSPORT THEORY