arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.02738cs.DCastro-ph.IM
收藏

SWIFT:使用基于任务的并行性、完全异步通信和基于图分区的域分解,可在超过100,000个内核上实现强大的可扩展性

SWIFT: Using task-based parallelism, fully asynchronous communication, and graph partition-based domain decomposition for strong scaling on more than 100,000 cores

Matthieu Schaller, Pedro Gonnet, Aidan B. G. Chalk, Peter W. Draper

摘要:

我们提出了一个新的开源宇宙学代码,称为SWIFT,旨在解决流体动力学方程,使用基于粒子的方法(光滑粒子流体动力学)的混合共享/分布式内存架构。SWIFT自自底向上的的设计旨在为商用集群(Tier-2系统)和Top100超级计算机(Tier-0系统)提供出色的强大扩展能力,而无需依赖特定于架构的功能或专用加速器硬件。这种性能是由于三种主要的计算方法:(1)基于任务的共享内存并行,它提供了细粒度的负载均衡,从而在大量的核心强大的伸缩性。(2)基于图的域分解,它使用任务图来分解仿真域,以便工作(而不仅仅是数据)在所有节点上均匀分布,而大多数分区方案都是如此。(3)完全动态和异步通信,其中通信被建模为基于任务的方案中的另一个任务,只要准备好就发送数据,并推迟依赖于来自其他节点的数据的任务,直到它到达。为了使用这些方法,代码必须从头开始重写,其中的算法必须适应基于任务的范式。因此,在基于x86和基于Power8的架构上,当核心数量增加512倍时,我们可以显示出60%以上的并行效率。

英文摘要:

We present a new open-source cosmological code, called SWIFT, designed to solve the equations of hydrodynamics using a particle-based approach (Smooth Particle Hydrodynamics) on hybrid shared/distributed-memory architectures. SWIFT was designed from the bottom up to provide excellent strong scaling on both commodity clusters (Tier-2 systems) and Top100-supercomputers (Tier-0 systems), without relying on architecture-specific features or specialized accelerator hardware. This performance is due to three main computational approaches: (1) Task-based parallelism for shared-memory parallelism, which provides fine-grained load balancing and thus strong scaling on large numbers of cores. (2) Graph-based domain decomposition, which uses the task graph to decompose the simulation domain such that the work, as opposed to just the data, as is the case with most partitioning schemes, is equally distributed across all nodes. (3) Fully dynamic and asynchronous communication, in which communication is modelled as just another task in the task-based scheme, sending data whenever it is ready and deferring on tasks that rely on data from other nodes until it arrives. In order to use these approaches, the code had to be re-written from scratch, and the algorithms therein adapted to the task-based paradigm. As a result, we can show upwards of 60% parallel efficiency for moderate-sized problems when increasing the number of cores 512-fold, on both x86-based and Power8-based architectures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑