Analysis of Massively Parallel Discrete-Ordinates Transport Sweep Algorithms with Collisions
Conference
·
OSTI ID:952433
We present theoretical scaling models for a variety of discrete-ordinates sweep algorithms. In these models, we pay particular attention to the way each algorithm handles collisions. A collision is defined as a processor having multiple angles with ready to be swept during one stage of the sweep. The models also take into account how subdomains are assigned to processors and how angles are grouped during the sweep. We describe a data driven algorithm that resolves collisions efficiently during the sweep as well as other algorithms that have been designed to avoid collisions completely. Our models are validated using the ARGES and AMTRAN transport codes. We then use the models to study and predict scaling trends in all of the sweep algorithms.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 952433
- Report Number(s):
- LLNL-CONF-407968
- Country of Publication:
- United States
- Language:
- English
Similar Records
3-D discrete ordinates calculations with parallel-vector processors
A discrete ordinate response matrix method for massively parallel computers
A discrete ordinate response matrix method for massively parallel computers
Conference
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6178476
A discrete ordinate response matrix method for massively parallel computers
Conference
·
Mon Dec 30 23:00:00 EST 1991
·
OSTI ID:10104733
A discrete ordinate response matrix method for massively parallel computers
Conference
·
Mon Dec 31 23:00:00 EST 1990
·
OSTI ID:7169654