Parallel processing of numerical transport algorithms

• Published in: Computer physics communications Vol. 37; no. 1; pp. 363 - 369
• Main Authors: Wienke, B.R., Hiromoto, R.E.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.01.1985
• ISSN: 0010-4655; 1879-2944
• DOI: 10.1016/0010-4655(85)90174-2

The multigroup, discrete ordinates representation for the linear transport equation enjoys widespread computational use and popularity. Serial solution schemes and numerical algorithms developed over the years provide a timely framework for parallel extension. On the Denelcor HEP, we investigate the parallel structure and extension of a number of standard S n approaches. Concurrent inner sweeps, coupled acceleration techniques, synchronized inner-outer loops, and chaotic iteration are described. and results of computations are contrasted. The multigroup representation and serial iteration methods are also detailed. The basic iterative S n method lends itself to parallel tasking, portably affording an effective medium for performing transport calculations on future architectures. This analysis represents a first attempt to extend serial S n algorithms efficiency, environments and provides good baseline estimates on ease of parallel implementation, relative algorithm efficiency, comparative speedup, and some future directions. We find basic inner-outer and chaotic iteration strategies both easily support comparable high degrees of parallelism. Both accomodate parallel rebalance and diffusion acceleration and appear as robust and viable parallel techniques for S n production work.