摘要
本文讨论超立方体结构上的并行FFT算法,着重分析算法的通信复杂性,并在此基础上导出算法的加速比.比较环和网状结构,超立方体上的并行FFT算法具有更好的性能.
This paper discusses the parallel FFT algorithm on the hypercube architecture. Based on the analysis of the communication complexity, the speedup of the algorithm is derived. Comparing with the ring or the mesh architecture, the parallel FFT algorithm on the hypercube is found to have better performances.
出处
《湖南大学学报（自然科学版）》
EI
CAS
CSCD
1992年第1期109-114,共6页
Journal of Hunan University:Natural Sciences
关键词
超立方体结构
并行算法
FFT
通信
parallel processing
algorithm
communications/FFT
parallel architecture
parallel algorithm
