Abstract
A new parallel processing system has been proposed. It is designed to perform parallel vector operations at maximum efficiency. In addition, it can also handle communicating vector operations and hence exploit irregular parallelism present in many apparently sequential algorithms. The novel features of this architecture offer a new kind of multi-processor facility which combines some of the advantages of an array processor with those of a vector processor. The system is therefore suitable for a wide range of algorithms with varying degrees of parallelism. In this paper, we give a brief description of the system, and discuss the implementation of the Cooley-Tukey FFT on this system with its simulation on Computer 757-the first vector computer of China. It is shown that the system's versatility allows it to achieve nearly a maximum degree of parallelism for this algorithm in the asymptotic case.
Similar content being viewed by others
References
R.H. Barlow and D.J. Evans, Parallel algorithms for the iterative solution to linear systems,Computer J.,25 (1982), 56–60.
E.O. Brigham, The Fast Fourier Transform, Prentice-Hall, 1974.
J.W. Cooley and J.W. Tukey, An algorithm for the machine calculation of complex fourier series,Math. Comput.,19 (1965), 297–301.
C.A.R. Hoare, Communicating sequential processes,Comm. ACM,21 (1978), 666–677.
R.N. Ibbett, P.C. Capon and N.P. Topham, MU6V: A parallel vector processing system,ACM Computer Architecture News,13 (1985), 136–144.
R.H. Perrot, A language for array and vector processors,ACM TOPLAS,1 (1979), 177–195.
H.S. Stone, Parallel processing with the perfect shuffle,IEEE Trans. Comput. 20 (1971), 153–161.
P.N. Swarztrauber, FFT algorithms for vector computers,Parallel Computing,1 (1984), 45–63.
Q.S. Gao and X. Zhang, Architecture of the first vector computer of China, Proceedings of the 1981 Inter. Confer on Parallel Processing, 300–301.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Qiao, X. An efficient parallel algorithm for FFT. J. of Comput. Sci. & Technol. 2, 174–190 (1987). https://doi.org/10.1007/BF02973503
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02973503