摘要
本文以一套Transputer并行计算机系统为背景,着重分析了快速富里叶变换(FFT)的并行性,提出了一种解决整序等影响并行效率的瓶颈问题的方法.最后对并行效率与处理机个数及变换点数之间的关系进行了分析.
This paper addresses in detail the parallelism of the Fast Fourier Transform (FFT) based on the transputer parallel computer system, and suggests an algorithm solving the bottleneck problem affecting the efficiency of parallelism such as sorting. Towards the end of this paper, the relation among efficiency of parallelism, number of processors and number of points transformed is explored.
出处
《小型微型计算机系统》
CSCD
北大核心
1992年第2期26-32,共7页
Journal of Chinese Computer Systems
关键词
Tranaputer
并行计算机
FFT
算法
Fast Fourier Transform (FFT), sorting, butterfly operation, inverted order, parallel algorithm, parallel programming
