Skip to main content

FFTVPLIB, a collection of Fast Fourier transforms for vectorprocessors

  • Efficient Use Of Vector Processors
  • Conference paper
  • First Online:
CONPAR 90 — VAPP IV (VAPP 1990, CONPAR 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 457))

  • 126 Accesses

Abstract

This paper describes the Fast Fourier Transform (FFT) subroutine library FFTVPLIB, which was developed for the Siemens Vector Processors, as a part of the ODIN — cooperation. The key feature of FFTVPLIB is the automatic selection between various data structures and vectorization methods, leading to high performance for most of the common forms of FFT's. It is suggested to generalize this concept to cover the whole spectrum of vectorprocessors by fixing a set of basic operations for Fourier transformations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.W. Cooley, J.W. Tukey: An algorithm for the machine calculation of complex Fourier series., Math. Comp. 19 (1965), 297–301

    Google Scholar 

  2. D.G. Korn, J.J. Lamboitte Jr.: Computing the Fast Fourier transform on a vector computer. Math. Comp. 33 (1979), 997

    Google Scholar 

  3. P.N. Swarztrauber: FFT algorithms for vector computers. Parallel Comput. 1 (1984), 45–63

    Article  Google Scholar 

  4. P.N. Swarztrauber: Mulitprocessor FFTs. Parallel Comput. 5 (1987), 197–210

    MathSciNet  Google Scholar 

  5. C. Lawson, R.J. Hanson, D. Kincaid, F.T Krough: Basic Linear Algebra Subprograms for Fortran usage. ACM Trans. Math. Software 5 (1979), 308–323

    Article  Google Scholar 

  6. J.J. Dongaara, J.J. Du Croz, S.J. Hammarling, R.J. Hanson: An extended set of Fortran Basic Linear Algebra Subprograms. ACM Trans. Math. Software 14 (1988), 1–7

    Article  Google Scholar 

  7. J.J. Dongarra, J.J. Du Croz, I.S. Duff, S.J. Hammarling: A set of level 3 Basic Linear Algebra Subprograms. NAG Technical Report TR 14/88 (1988) (to be published in ACM Trans. Math. Software)

    Google Scholar 

  8. J.J. Du Groz, P.J.B. Moyes, J. Wasniewski, S. Wilson: Application of level 2 BLAS in the NAG libary. Parallel Comput. 8 (1988) 345–350

    Article  Google Scholar 

  9. W. Waelde, O. Haan: Optimization of the FFT for Siemens VP-Systems. University of Karlsruhe, Computer Center, Internal Report No. 37.89 (1989)

    Google Scholar 

  10. C. Temperton: Self-Sorting Mixed-Radix Fast Fourier Transform. J. Comput. Physics, Volume 52 (1983) 1–23

    Article  Google Scholar 

  11. D.H. Bailey: High Performance FFT Algorithm for Vector Supercomputers. Int. J. of Supercomputer Applications, No. 1, Springer (1988) 82–87

    Google Scholar 

  12. W. Ewinger, O. Haan, E. Haupenthal, C. Siemers: Modelling and measurements of memory access in SIEMENS VP supercomputers. Parallel Comput. 11 (1989) 361–365

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Helmar Burkhart

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haan, O., Waelde, W. (1990). FFTVPLIB, a collection of Fast Fourier transforms for vectorprocessors. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_123

Download citation

  • DOI: https://doi.org/10.1007/3-540-53065-7_123

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53065-7

  • Online ISBN: 978-3-540-46597-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics