Parallelization of radiation transport on unstructured triangular grids with spatial decomposition a

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.

[1]  P Nowak,et al.  Radiation transport calculations on unstructured grids using a spatially decomposed and threaded algorithm , 1999 .

[2]  Pedro J. Coelho,et al.  PARALLELIZATION OF THE DISCRETE ORDINATES METHOD , 1997 .

[3]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[4]  John P. Hayes,et al.  Some Practical Issues in the Design of Fault-Tolerant Multiprocessors , 1992, IEEE Trans. Computers.

[5]  Sudhakar Yalamanchili,et al.  A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[6]  Christon,et al.  Spatial domain-based parallelism in large scale, participating-media, radiative transport applications , 1996 .

[7]  Jie Wu.  Fault-Tolerant Adaptive and Minimal Routing in Mesh-Connected Multicomputers Using Extended Safety Levels , 2000, IEEE Trans. Parallel Distributed Syst..

[8]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[9]  Jie Wu,et al.  A distributed formation of orthogonal convex polygons in mesh-connected multicomputer , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[10]  Eduard Ayguadé,et al.  Scaling irregular parallel codes with minimal programming effort , 2001, SC.

[11]  Alireza Haghighat,et al.  DOMAIN DECOMPOSITION OF A TWO-DIMENSIONAL SN METHOD , 1992 .

[12]  Edward W. Larsen,et al.  Iterative Methods for Solving x-y Geometry SN Problems on Parallel Architecture Computers , 1992 .

[13]  Sigurd L. Lillevik,et al.  The Touchstone 30 Gigaflop DELTA Prototype , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.

[14]  J. C. Yanch,et al.  Current status of Neutron Capture Therapy in the United States , 1995 .

[15]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[16]  Nian-Feng Tzeng,et al.  Maximum reconfiguration of 2-D mesh systems with faults , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[17]  Yousry Y. Azmy.  Performance and performance modeling of a parallel algorithm for solving the neutron transport equation , 2004, The Journal of Supercomputing.

[18]  Steven J. Plimpton,et al.  Parallel Algorithms for Radiation Transport on Unstructured Grids , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[19]  Cherri M. Pancake,et al.  Is parallelism for you , 1996 .

[20]  Christon,et al.  Spatial domain-based parallelism in large-scale, participating-media, radiative transport applications , 1997 .

[21]  Jay Hoeflinger,et al.  Producing scalable performance with OpenMP: Experiments with two CFD applications , 2001, Parallel Comput..