arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.02056physics.comp-ph
收藏

Particle-In-Cell程序中电荷/电流沉积的有效和可移植的SIMD算法

An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes

H. Vincenti, R. Lehe, R. Sasanka, J-L. Vay

摘要:

在目前的计算机架构中,数据移动(从芯片到网络)是算法中最耗能的部分(芯片上10 pJ/字到网络上10,000 pJ/字)。为了在硬件级别增加内存局部性并减少与数据移动相关的能耗,未来的亿亿次计算机倾向于在每个计算节点(“胖节点”)上使用越来越多的内核,这些节点将具有降低的时钟速度以允许有效的冷却。为了补偿频率的降低,机器供应商正在使用长SIMD指令寄存器,这些寄存器能够在一个时钟周期内用一个算术运算符处理多个数据。SIMD寄存器长度预计每四年翻一番。因此,Particle-In-Cell(PIC)代码必须实现良好的矢量化,才能充分利用这些即将到来的架构。在本文中,我们提出了一种新的算法,允许有效的和便携式的SIMD矢量化的电流/电荷沉积例程,随着现场收集例程,PIC算法中最耗时的部分。我们的新算法使用了一种特殊的数据结构,该结构考虑了内存扩展约束,并避免了聚集/分散指令,这些指令可能会显着影响当前CPU上的矢量化性能。新算法在三维骨架PIC代码PICSAR中成功实现,并在Haswell Xeon处理器(AVX 2 -256位宽数据寄存器)上进行了测试。结果表明,对于$1$到$3$级的颗粒形状因子,$\times 2$到$\times 2.5$的因子以双倍精度加速。新算法可以应用于未来的KNL(Knights Landing)架构,该架构将包括具有512位寄存器长度(8个双/16个单)的AVX-512指令集。

英文摘要:

In current computer architectures, data movement (from die to network) is by far the most energy consuming part of an algorithm (10pJ/word on-die to 10,000pJ/word on the network). To increase memory locality at the hardware level and reduce energy consumption related to data movement, future exascale computers tend to use more and more cores on each compute nodes ("fat nodes") that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD register length is expected to double every four years. As a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage of these upcoming architectures. In this paper, we present a new algorithm that allows for efficient and portable SIMD vectorization of current/charge deposition routines that are, along with the field gathering routines, among the most time consuming parts of the PIC algorithm. Our new algorithm uses a particular data structure that takes into account memory alignement constraints and avoids gather/scatter instructions that can significantly affect vectorization performances on current CPUs. The new algorithm was successfully implemented in the 3D skeleton PIC code PICSAR and tested on Haswell Xeon processors (AVX2-256 bits wide data registers). Results show a factor of $\times 2$ to $\times 2.5$ speed-up in double precision for particle shape factor of order $1$ to $3$. The new algorithm can be applied as is on future KNL (Knights Landing) architectures that will include AVX-512 instruction sets with 512 bits register lengths (8 doubles/16 singles).

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

↑