Abstract: We analyze domain decomposition and priority queuing algorithms for neutron transport equations with 2-D cylindrical geometry. A domain decomposition method based on the lowest surface-to-volume aspect and a corresponding priority queuing algorithm are proposed.Numerical experiments indicate that the method exhibits perfect speedup with hundreds of processors on parallel computers with high network latency.

Key words: transport equation, discrete ordinate method, discontinuous finite element, domain decomposition, sweep algorithm