首页 | 本学科首页   官方微博 | 高级检索  
     

任意长—维DFT的MIMD并行算法
引用本文:成礼智. 任意长—维DFT的MIMD并行算法[J]. 应用数学学报, 1996, 0(4)
作者姓名:成礼智
作者单位:国防科技大学七系
摘    要:本文提出了共享与分布式存储计算机上任意长—维DFT的MIMD并行算法,若N=O(p,q),则算法需要次算术运算。其中,P与N可为任意自然数,分别表示处理机台数与DFT长度.本文算法具有很高的并行效率.

关 键 词:DFT,MIMD并行算法,并行处理机

MIMD PARALLEL ALGORITHMS FOR COMPUTING ONE DIMENSIONAL DFT OF ARBITRARY LENGTH
CHENG LIZHI. MIMD PARALLEL ALGORITHMS FOR COMPUTING ONE DIMENSIONAL DFT OF ARBITRARY LENGTH[J]. Acta Mathematicae Applicatae Sinica, 1996, 0(4)
Authors:CHENG LIZHI
Abstract: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.
Keywords:DFT  MIMD parallel algorithm  parallel processor
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号