Paper Info
Title
Parallel Flux Sweep Algorithm for Neutron Transport on Unstructured Grid
Abstract
Discontinuous finite element discrete ordinates (DFE-Sn) method is widely used to solve the time-dependent neutron transport equation for nuclear science and engineering applications. Most efficiently, the kernel is to iteratively sweep the neutron flux across the computational grid. However, for unstructured grid this will bring forward several challenges while implemented on distributed memory parallel computers where the grid are decomposed across processors. This paper presents a parallel flux sweep algorithm to improve the parallel scalability of this basic sweep algorithm on unstructured grid under 2-D cylindrical Lagrange coordinates system from two sides. One is to prioritize the sweep order of elements within each subdomain, another is to better decompose the unstructured grid across processors. With optimal combination of domain decomposition method and priority queuing algorithm, this parallel algorithm has successfully been incorporated into DFE-Sn method and has been implemented with MPI to solve the neutron and photon coupled transport equation for complex physics. Performance results for two different applications on hundreds of processors of two parallel computers are given in this paper. In particular, the parallel solver has respectively achieved speedup larger than 72 using 92 processors and 78 using 256 processors on these two machines.
Year
DOI
Venue
2004
10.1023/B:SUPE.0000032778.36178.d8
The Journal of Supercomputing
Keywords
Field
DocType
unstructured grid,neutron transport,parallel flux sweep algorithm
Neutron transport,Computer science,Unstructured grid,Parallel algorithm,Parallel computing,Algorithm,Distributed memory,Domain decomposition methods,Grid,Sweep line algorithm,Speedup,Distributed computing
Journal
Volume
Issue
ISSN
30
1
1573-0484
Citations 
PageRank 
References 
6
0.57
3
Authors
2
Name
Order
Citations
PageRank
Zeyao Mo17319.48
Fu Lianxiang260.57