TY - GEN
T1 - Parallel SN sweeps on adapted meshes
AU - Turcksin, Bruno
PY - 2015
Y1 - 2015
N2 - We study parallel sweeps on adaptively refined meshes. Unlike parallel sweeps on regular grids, there is not a known optimal parallel sweep on unstructured meshes and thus, multiple heuristics have been proposed over the years. In this paper, we study the CAP-PFB (Cut Arc Preference-Parallel Forward Backward) algorithm on regular grids and adaptively refined meshes. We begin by recalling the CAP-PFB heuristic, then we explain how it can be applied on adapted meshes. After that, we compare the sweeps produced by CAP-PFB when different initial sweeps are used on regular and adapted meshes. We show that on regular grids, CAP-PFB finds an optimal sweep independendy of the initial sweep. On adapted meshes, the best results are obtained when using a serial initial sweep for CAP-PFB. This is somewhat unexpected; the "worst" initial sweep leads to the best result. We conclude that a good initial sweep for CAP-PFB, on adapted meshes, should take into account the interaction of sweeps along different directions before trying to minimize the number of stages required.
AB - We study parallel sweeps on adaptively refined meshes. Unlike parallel sweeps on regular grids, there is not a known optimal parallel sweep on unstructured meshes and thus, multiple heuristics have been proposed over the years. In this paper, we study the CAP-PFB (Cut Arc Preference-Parallel Forward Backward) algorithm on regular grids and adaptively refined meshes. We begin by recalling the CAP-PFB heuristic, then we explain how it can be applied on adapted meshes. After that, we compare the sweeps produced by CAP-PFB when different initial sweeps are used on regular and adapted meshes. We show that on regular grids, CAP-PFB finds an optimal sweep independendy of the initial sweep. On adapted meshes, the best results are obtained when using a serial initial sweep for CAP-PFB. This is somewhat unexpected; the "worst" initial sweep leads to the best result. We conclude that a good initial sweep for CAP-PFB, on adapted meshes, should take into account the interaction of sweeps along different directions before trying to minimize the number of stages required.
KW - AMR
KW - Parallel transport
KW - Transport sweeps
UR - http://www.scopus.com/inward/record.url?scp=84949522675&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84949522675
T3 - Mathematics and Computations, Supercomputing in Nuclear Applications and Monte Carlo International Conference, M and C+SNA+MC 2015
SP - 1206
EP - 1217
BT - Mathematics and Computations, Supercomputing in Nuclear Applications and Monte Carlo International Conference, M and C+SNA+MC 2015
PB - American Nuclear Society
T2 - Mathematics and Computations, Supercomputing in Nuclear Applications and Monte Carlo International Conference, M and C+SNA+MC 2015
Y2 - 19 April 2015 through 23 April 2015
ER -