Abstract
A distributed memory vectorised 1-dimensional FFT benchmark is first presented. The performance results of this benchmark on Suprenum are given and discussed. A performance analysis of the distributed memory FFT benchmark is performed and Hockney's performance parameters (r ∞ and n 1/2) are then employed to derive the performance formula. This formula is shown to fit the experimental results very well. A generalization of the analysis for uniformly distributed applications is also discussed, as well as some important characteristics such as the calculation/communication ratio, the fit of the application to the architecture, the average message length and the average vector length.
Preview
Unable to display preview. Download preview PDF.
References
G.M. Amdahl. The validity of the single processor approach to achieving large scale computing capabilities. AFIPS Conference Proceedings, 30:483–485, 1967. 1967 Spring Joint Computer Conference, Thompson Books and Academic Press.
R.M. Chamberlain. Gray codes, Fast Fourier Transforms and hypercubes. Parallel Computing, 6(2):225–233, February 1988.
J.W. Cooley and J.W. Tukey. An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19(90):297–301, 1965.
W.K. Giloi. SUPRENUM: A trendsetter in modern supercomputer development. Parallel Computing, 7(3):283–296, September 1988.
A.J.G. Hey. The GENESIS distributed memory benchmarks. Parallel Computing, 17(10 & 11):1275–1283, December 1991.
R.W. Hockney and C.R. Jesshope. Parallel Computers 2: Architecture, Programming and Algorithms. Adam Hilger, Bristol, 1988.
R.W. Hockney. A framework for benchmark performance analysis. In Proceedings of the 2nd Euroben Workshop, September 1991. To appear in Supercomputer (ASFRA, The Netherlands).
H. Kammer. The SUPRENUM vector floating-point unit. Parallel Computing, 7(3):315–323, September 1988.
D.H. Lawrie. Access and alignment of data in an array processor. IEEE Trans. on Computers, 24(12):1145–1155, December 1975.
M.C. Pease. An adaptation of the Fast Fourier Transform for parallel processing. Journal of the ACM, 15(2):252–264, April 1968.
M.C. Pease. The indirect binary n-cube microprocessor array. IEEE Trans. on Computers, 26(5):458–473, May 1977.
P.N. Swarztrauber. Multiprocessor FFTs. Parallel Computing, 5(1 & 2):197–210, July 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Getov, V. (1992). 1-Dimensional parallel FFT benchmark on SUPRENUM. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_87
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_87
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive