An FFT performance model for optimizing general-purpose processor architecture

Authors:
Ling Li;Yun-Ji Chen;Dao-Fu Liu;Cheng Qian;Wei-Wu Hu
Affiliations:
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and Loongson Technologies Corporation Limited, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and Loongson Technologies Corporation Limited, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and Loongson Technologies Corporation Limited, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and Loongson Technologies Corporation Limited, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and Loongson Technologies Corporation Limited, Beijing, China
Venue:
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
Year:
2011

Citing 14
Cited 0

Parallelization and Performance Analysis of the Cooley-Tukey FFT Algorithm for Shared-Memory Architectures

IEEE Transactions on Computers
Performance analysis of the FFT algorithm on a shared-memory parallel architecture

IBM Journal of Research and Development
Performance of image and video processing with general-purpose processors and media ISA extensions

ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
A performance analysis of PIM, stream processing, and tiled processing on memory-intensive signal processing kernels

Proceedings of the 30th annual international symposium on Computer architecture
Learning to construct fast signal processing implementations

The Journal of Machine Learning Research
High performance discrete Fourier transforms on graphics processors

Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Fast Fourier Transforms: for fun and profit

AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Computer generation of fast fourier transforms for the cell broadband engine

Proceedings of the 23rd international conference on Supercomputing
Godson-3: A Scalable Multicore RISC Processor with x86 Emulation

IEEE Micro
A performance model for Fast Fourier Transform

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling

PACT '09 Proceedings of the 2009 18th International Conference on Parallel Architectures and Compilation Techniques
FFTC: fastest Fourier transform for the IBM cell broadband engine

HiPC'07 Proceedings of the 14th international conference on High performance computing
Design of an application-specific instruction set processor for high-throughput and scalable FFT

Proceedings of the Conference on Design, Automation and Test in Europe
DFT performance prediction in FFTW

LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

General-purpose processor (GPP) is an important platform for fast Fourier transform (FFT), due to its flexibility, reliability and practicality. FFT is a representative application intensive in both computation and memory access, optimizing the FFT performance of a GPP also benefits the performances of many other applications. To facilitate the analysis of FFT, this paper proposes a theoretical model of the FFT processing. The model gives out a tight lower bound of the runtime of FFT on a GPP, and guides the architecture optimization for GPP as well. Based on the model, two theorems on optimization of architecture parameters are deduced, which refer to the lower bounds of register number and memory bandwidth. Experimental results on different processor architectures (including Intel Core i7 and Godson-3B) validate the performance model. The above investigations were adopted in the development of Godson-3B, which is an industrial GPP. The optimization techniques deduced from our performance model improve the FFT performance by about 40%, while incurring only 0.8% additional area cost. Consequently, Godson-3B solves the 1024-point single-precision complex FFT in 0.368 µs with about 40 Watt power consumption, and has the highest performance-per-watt in complex FFT among processors as far as we know. This work could benefit optimization of other GPPs as well.