1-Dimensional parallel FFT benchmark on SUPRENUM

  • Vladimir Getov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 605)


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 n1/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.


distributed memory FFT benchmark performance formulae and parameters Suprenum performance 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Amd67]
    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.Google Scholar
  2. [Cha88]
    R.M. Chamberlain. Gray codes, Fast Fourier Transforms and hypercubes. Parallel Computing, 6(2):225–233, February 1988.CrossRefMathSciNetGoogle Scholar
  3. [CT65]
    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.Google Scholar
  4. [Gil88]
    W.K. Giloi. SUPRENUM: A trendsetter in modern supercomputer development. Parallel Computing, 7(3):283–296, September 1988.CrossRefGoogle Scholar
  5. [Hey91]
    A.J.G. Hey. The GENESIS distributed memory benchmarks. Parallel Computing, 17(10 & 11):1275–1283, December 1991.CrossRefGoogle Scholar
  6. [HJ88]
    R.W. Hockney and C.R. Jesshope. Parallel Computers 2: Architecture, Programming and Algorithms. Adam Hilger, Bristol, 1988.Google Scholar
  7. [Hoc91]
    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).Google Scholar
  8. [Kam88]
    H. Kammer. The SUPRENUM vector floating-point unit. Parallel Computing, 7(3):315–323, September 1988.CrossRefGoogle Scholar
  9. [Law75]
    D.H. Lawrie. Access and alignment of data in an array processor. IEEE Trans. on Computers, 24(12):1145–1155, December 1975.Google Scholar
  10. [Pea68]
    M.C. Pease. An adaptation of the Fast Fourier Transform for parallel processing. Journal of the ACM, 15(2):252–264, April 1968.CrossRefGoogle Scholar
  11. [Pea77]
    M.C. Pease. The indirect binary n-cube microprocessor array. IEEE Trans. on Computers, 26(5):458–473, May 1977.Google Scholar
  12. [Swa87]
    P.N. Swarztrauber. Multiprocessor FFTs. Parallel Computing, 5(1 & 2):197–210, July 1987.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Vladimir Getov
    • 1
  1. 1.Dept. of Electronics & Computer ScienceUniversity of SouthamptonSouthamptonUK

Personalised recommendations