Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Parallel algorithms for radiation transport on unstructured grids
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Producing scalable performance with OpenMP: experiments with two CFD applications
Parallel Computing - Special issue on parallel computing in aerospace
Scaling irregular parallel codes with minimal programming effort
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
IEEE Computational Science & Engineering
Parallel algorithms for Sn transport sweeps on unstructured meshes
Journal of Computational Physics
| Hi-index | 0.00 |
Parallel computing can be of critical importance to the deterministic solution of radiation transport equations, especially with respect to solving the transport process within highly variable media with complex geometries. We propose an approach that extends the Alternating Direction of Transport Sweeps (ADTS) method of M. Yavus and E.D. Larson to unstructured triangular grids, using the Recursive Spectral Bisection (RSB) algorithm to partition our domain and OpenMP to implement the parallelism on shared memory computers. Our results, using a neutron transport test case, show that the ADTS method with the RSB algorithm leads to a significant increase in the parallel convergence rate, resulting in improved parallel efficiency, and thus improved turnaround time. We emphasize that excellent parallel efficiency is possible using domain decomposition and an SPMD-OpenMP implementation.