任意长—维DFT的MIMD并行算法

MIMD PARALLEL ALGORITHMS FOR COMPUTING ONE DIMENSIONAL DFT OF ARBITRARY LENGTH

本文提出了共享与分布式存储计算机上任意长—维ＤＦＴ的ＭＩＭＤ并行算法，若Ｎ＝Ｏ（ｐ，ｑ），则算法需要次算术运算。其中，Ｐ与Ｎ可为任意自然数，分别表示处理机台数与ＤＦＴ长度．本文算法具有很高的并行效率．

in this paper f MIMD parallel algorithms for computing N points one-dimensionalDFT on p processors with shared-memory and distributed-memory are developed,respectively.If N = O(p.q),then the algorithms need O () arithmeticoperations,where p and N may be arbitrary number moreover, the efficiency and speedupratio promoted with the new algorithms.