Parallel processing of numerical transport algorithms
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/sub 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/sub 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/sub n/ algorithms to parallel 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 comparably high degrees of parallelism. Both accommodate parallel rebalance and diffusion acceleration and appear as robust and viable parallel techniques for S/sub n/ production work.
- Research Organization:
- Los Alamos National Lab., NM (USA)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 6522775
- Report Number(s):
- LA-UR-84-2609; CONF-8408100-1; ON: DE84016825
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel S/sub n/ transport algorithms
Parallel S /sub n/ iteration schemes