基于OPS的大规模压缩编码中的循环拼接
Loop Tiling in Large-Scale Stencil Codes at Run-time with OPS
摘要:
大多数模板代码中的关键共同瓶颈是数据移动,先前的研究表明,通过优化跨循环调度来提高数据局部性效果特别好。然而,在许多大型PDE应用程序中,不可能通过编译器应用这种优化,因为每个网格点有许多选项、执行路径和数据,许多依赖于运行时间参数,并且代码分布在不同的编译单元中。在本文中,我们适应的数据局部性改善优化称为迭代空间切片用于大型OPS应用程序中的共享内存和分布式内存系统,依赖于运行时间分析和延迟执行。我们评估我们的方法在一些应用程序,观察加速2 $\times$的立体式2D/3D代理应用程序,其中包含83/141循环分别,$3.5\times$的线性求解器TeaLeaf,和$1.7\times$的可压缩的Navier-Stokes求解器OpenSBLI。我们展示了强大和薄弱的可扩展性高达4608个核心的CINECA的马可尼超级计算机。我们还在英特尔的Knights Landing上评估了我们的算法,证明了当问题大小超过16 GB时保持的吞吐量,并且我们进行了高达8704个核心的扩展研究。该方法通常可应用于提供每循环数据访问信息的任何模板DSL。
英文摘要:
The key common bottleneck in most stencil codes is data movement, and prior research has shown that improving data locality through optimisations that schedule across loops do particularly well. However, in many large PDE applications it is not possible to apply such optimisations through compilers because there are many options, execution paths and data per grid point, many dependent on run-time parameters, and the code is distributed across different compilation units. In this paper, we adapt the data locality improving optimisation called iteration space slicing for use in large OPS applications both in shared-memory and distributed-memory systems, relying on run-time analysis and delayed execution. We evaluate our approach on a number of applications, observing speedups of 2$\times$ on the Cloverleaf 2D/3D proxy application, which contain 83/141 loops respectively, $3.5\times$ on the linear solver TeaLeaf, and $1.7\times$ on the compressible Navier-Stokes solver OpenSBLI. We demonstrate strong and weak scalability up to 4608 cores of CINECA's Marconi supercomputer. We also evaluate our algorithms on Intel's Knights Landing, demonstrating maintained throughput as the problem size grows beyond 16GB, and we do scaling studies up to 8704 cores. The approach is generally applicable to any stencil DSL that provides per loop data access information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。