A Volumetric FFT for BlueGene/L
A Volumetric FFT for BlueGene/L
复制标题
BlueGene/L 的体积 FFT
DOI：
10.1007/978-3-540-24596-4_21
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
R. Germain
中科院分区：
文献类型：
--
作者：
M. Eleftheriou;J. Moreira;B. Fitch;R. Germain
BlueGene/L是一个大规模并行超级计算机，由计算节点组成的三维环面。利用BlueGene/L的新计算能力的一个基本挑战是在数千个节点上有效扩展的数值算法的设计和实现。一个特别重要的计算核心是三维数据的快速傅里叶变换（FFT）。在本文中，我们介绍了我们在BlueGene/L中采用的方法来产生可扩展的FFT实现。我们依靠数据的体积分解来利用环形通信拓扑。我们使用基于mpi的算法实现来展示实验结果，以测试我们分解背后的基本原则，并允许在现有平台上进行实验。我们的初步结果表明，对于大小为128 × 128 × 128的三维fft，我们的算法可以在多达512个节点上进行很好的扩展。
BlueGene/L is a massively parallel supercomputer organized as a three-dimensional torus of compute nodes. A fundamental challenge in harnessing the new computational capabilities of BlueGene/L is the design and implementation of numerical algorithms that scale effectively on thousands of nodes. A computational kernel of particular importance is the Fast Fourier Transform (FFT) of three-dimensional data. In this paper, we present the approach we are taking in BlueGene/L to produce a scalable FFT implementation. We rely on a volume decomposition of the data to take advantage of the toroidal communication topology. We present experimental results using an MPI-based implementation of our algorithm, in order to test the basic tenets behind our decomposition and to allow experimentation on existing platforms. Our preliminary results indicate that our algorithm scales well on as many as 512 nodes for three-dimensional FFTs of size 128 × 128 × 128.