在SO上的FFT的电化学化(3)
Parallelization of the FFT on SO(3)
摘要:
在本文中,一个工作最佳的并行Kostelec和Rockmore的著名的快速傅立叶变换及其逆的三维旋转群SO(3)的设计,实现,并测试。为此,首先简要回顾了顺序算法。在后续的并行算法的设计和实现中,我们采用了著名的Forster(PCAM)方法和OpenMP标准。并行化本身是基于基本基函数的对称性和几何方法,其中所得到的索引范围以这样一种方式进行变换,即不同的工作包可以有效地分布到计算节点。在一个64核的系统上进行的加速比和效率评估基准测试证明了并行算法在实践中的好处。这里,我们第一次为准确度和存储器关键带宽512两者的全变换呈现积极结果。使用所有64个可用核,对于所考虑的最大带宽128、256和512的加速比在前向变换中分别为29.57、36.86和34.36,在逆变换中分别为24.57、26.69和24.25。
英文摘要:
In this paper, a work-optimal parallelization of Kostelec and Rockmore's well-known fast Fourier transform and its inverse on the three-dimensional rotation group SO(3) is designed, implemented, and tested. To this end, the sequential algorithms are reviewed briefly first. In the subsequent design and implementation of the parallel algorithms, we use the well-known Forster (PCAM) method and the OpenMP standard. The parallelization itself is based on symmetries of the underlying basis functions and a geometric approach in which the resulting index range is transformed in such a way that distinct work packages can be distributed efficiently to the computation nodes. The benefit of the parallel algorithms in practice is demonstrated in a speedup- and efficiency-assessing benchmark test on a system with 64 cores. Here, for the first time, we present positive results for the full transforms for the both accuracy- and memory-critical bandwidth 512. Using all 64 available cores, the speedup for the largest considered bandwidths 128, 256, and 512 amounted to 29.57, 36.86, and 34.36 in the forward, and 24.57, 26.69, and 24.25 in the inverse transform, respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。