Parallelization of PANDA discrete ordinates code using spatial decomposition

Conference · Sat Jul 01 00:00:00 EDT 2006

OSTI ID:22039559

Humbert, P ^[1]

---

1. Commissariat a l'Energie Atomique CEA, 91680 Bruyeres le Chatel (France)

We present the parallel method, based on spatial domain decomposition, implemented in the 2D and 3D versions of the discrete Ordinates code PANDA. The spatial mesh is orthogonal and the spatial domain decomposition is Cartesian. For 3D problems a 3D Cartesian domain topology is created and the parallel method is based on a domain diagonal plane ordered sweep algorithm. The parallel efficiency of the method is improved by directions and octants pipelining. The implementation of the algorithm is straightforward using MPI blocking point to point communications. The efficiency of the method is illustrated by an application to the 3D-Ext C5G7 benchmark of the OECD/NEA. (authors)

• Research Organization: American Nuclear Society, 555 North Kensington Avenue, La Grange Park, IL 60526 (United States)
• OSTI ID: 22039559
• Resource Relation: Conference: PHYSOR-2006: American Nuclear Society's Topical Meeting on Reactor Physics - Advances in Nuclear Analysis and Simulation, Vancouver, BC (Canada), 10-14 Sep 2006; Other Information: Country of input: France; 3 refs.
• Country of Publication: United States
• Language: English

Related Subjects

22 GENERAL STUDIES OF NUCLEAR REACTORS
97 MATHEMATICAL METHODS AND COMPUTING
ALGORITHMS
BENCHMARKS
DISCRETE ORDINATE METHOD
EFFICIENCY
NEA
NEUTRON SOURCES
P CODES
PARALLEL PROCESSING