An Analysis of FFTW and FFTE Performance

  • Miloš Nikolić
  • Aleksandar Jović
  • Josip Jakić
  • Vladimir Slavnić
  • Antun Balaž
Part of the Modeling and Optimization in Science and Technologies book series (MOST, volume 2)

Abstract

One of the most frequently used algorithms in engineering and scientific applications is Fast Fourier Transform (FFT). Its open source implementation (Fastest Fourier Transform of the West, FFTW) is widely used, mainly due to its excellent performance, comparable to the vendor-supplied libraries. On the other hand, even if not yet in a fully production state, FFTE (Fastest Fourier Transform of the East) keeps up with FFTW, and outperforms it for very large transform sizes. Here we present results of the performance and scalability tests of FFTW and FFTE libraries. Comparison is done using different compilers and parallelization approaches on CURIE and JUGENE supercomputers.

Keywords

FFT MPI OpenMP Hybrid parallelism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
  3. 3.
  4. 4.
    PRACE Home Page, http://www.prace-ri.eu/
  5. 5.
    FFTW Home Page, http://www.fftw.org/
  6. 6.
    FFTE: A Fast Fourier Transform Package, http://www.ffte.jp/

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Miloš Nikolić
    • 1
  • Aleksandar Jović
    • 1
  • Josip Jakić
    • 1
  • Vladimir Slavnić
    • 1
  • Antun Balaž
    • 1
  1. 1.Scientific Computing Laboratory, Institute of Physics BelgradeUniversity of BelgradeBelgradeSerbia

Personalised recommendations