Validation of Full-Domain Massively Parallel Transport Sweep Algorithms

摘要

These computational results validate the predictions made by the sweep algorithm performance models. Codes based on sweep algorithms and domain decompositions implemented as described here and in the referenced publications will scale to millions of MPI ranks and potentially beyond. The strength of this study is the demonstration of the validity of sweep algorithm scaling predictions using two vastly different codes with markedly different domain decomposition and spatial discretization choices. Additional research into algorithms and strategies, as well as code improvements, will almost certainly result in improved efficiencies.