Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1712
Title: An Analysis of FFTW and FFTE Performance
Authors: Nikolić, Miloš
Jović, Aleksandar 
Jakić, Josip
Affiliations: Numerical Mathematics and Optimization 
Slavnić, Vladimir
Issue Date: 2014
Rank: M13
Publisher: Springer
Related Publication(s): High-Performance Computing Infrastructure for South East Europe's Research Communities : Results of the HP-SEE User Forum 2012
Journal: Modeling and Optimization in Science and Technologies
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.
URI: https://research.matf.bg.ac.rs/handle/123456789/1712
DOI: 10.1007/978-3-319-01520-0_20
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

6
checked on Apr 3, 2025

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.