一种面向MIMD并行机实现的FFT并行算法

A Parallel Algorithm for Computing FFT on MIMD Parallel Computers

  • 摘要: 提出了一种适合于多指令流多数据流并行机和计算机网络并行实现的快速傅里叶变换的系数矩阵块对角化并行算法。该并行算法的并行度高,且各个并行任务在运算期间不需要互相通信,因而在计算机网络及通信速率和带宽较低的并行计算机上并行实现时效率较高。

     

    Abstract: An effcient parallel algorithm of block diagonalization of coefficient matrix for calculating fast fourier transform (FFT) on the computer network or multiple instruction stream & multiple data stream (MIMD) parallel computers is presented in this paper.Beacuse it need not exchange data between computers during parallel computing,this parallel algorithm is especially suitable for implementation on the computer network and MIMD parallel computers whose communicational rate and bandwith are low.

     

/

返回文章
返回