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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
