Rights accessRestricted access - publisher's policy
The Boltzmann Transport Equation is solved on unstructured meshes using the Discrete
Ordinates Method. The flux for each ordinate is swept across the computational grid,
within a source iteration loop that accounts for the coupling between the different
ordinates. In this paper, a spatial domain decomposition strategy is used to divide the work among the available CPUs. The sequential nature of the sweep process makes the parallelization of the overall algorithm the most challenging aspect. Several parallel sweep algorithms, which represent different options of interleaving communications and calculations in the solution process, are analysed. The option of grouping messages by means of buffering is also considered. One of the heuristics proposed consistently stands out as
the best option in all the situations analyzed, which include different geometries and different sizes of the ordinate set. With this algorithm, good scalability results have been achieved regarding both weak and strong speedup tests with up to 2560 CPUs.
CitationColomer, G. [et al.]. Parallel algorithms for Sn transport sweeps on unstructured meshes. "Journal of computational physics", 01 Gener 2013, vol. 232, núm. 1, p. 118-135.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com