We use cookies to improve your experience with our site.
Jie Yan, Guang-Ming Tan, Ning-Hui Sun. Optimizing Parallel Sn Sweeps on Unstructured Grids for Multi-Core Clusters[J]. Journal of Computer Science and Technology, 2013, 28(4): 657-670. DOI: 10.1007/s11390-013-1366-9
Citation: Jie Yan, Guang-Ming Tan, Ning-Hui Sun. Optimizing Parallel Sn Sweeps on Unstructured Grids for Multi-Core Clusters[J]. Journal of Computer Science and Technology, 2013, 28(4): 657-670. DOI: 10.1007/s11390-013-1366-9

Optimizing Parallel Sn Sweeps on Unstructured Grids for Multi-Core Clusters

  • In particle transport simulations, radiation effects are often described by the discrete ordinates (Sn) form of Boltzmann equation. In each ordinate direction, the solution is computed by sweeping the radiation flux across the grid. Parallel Sn sweep on an unstructured grid can be explicitly modeled as topological traversal through an equivalent directed acyclic graph (DAG), which is a data-driven algorithm. Its traditional design using MPI model results in irregular communication of massive short messages which cannot be efficiently handled by MPI runtime. Meanwhile, in high-end HPC cluster systems, multicore has become the standard processor configuration of a single node. The traditional data-driven algorithm of Sn sweeps has not exploited potential advantages of multi-threading of multicore on shared memory. These advantages, however, as we shall demonstrate, could provide an elegant solution resolving problems in the previous MPI-only design. In this paper, we give a new design of data-driven parallel Sn sweeps using hybrid MPI and Pthread programming, namely Sweep-H, to exploit hierarchical parallelism of processes and threads. With special multi-threading techniques and vertex schedule policy, Sweep-H gets more efficient communication and better load balance. We further present an analytical performance model for Sweep-H to reveal why and when it is advantageous over former MPI counterpart. On a 64-node multicore cluster system with 12 cores per node, 768 cores in total, Sweep-H achieves nearly linear scalability for moderate problem sizes, and better absolute performance than the previous MPI algorithm on more than 16 nodes (by up to two times speedup on 64 nodes).
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return