A Blocking Algorithm for FFT on Cache-Based Processors

Authors:
Daisuke Takahashi
Affiliations:
-
Venue:
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Year:
2001

Citing 4
Cited 1

FFTs in external or hierarchical memory

The Journal of Supercomputing
Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
The Fastest Fourier Transform in the West

The Fastest Fourier Transform in the West
High Performance FFT Algorithms for Cache-Coherent Multiprocessors

International Journal of High Performance Computing Applications

A Blocking Algorithm for Parallel 1-D FFT on Clusters of PCs

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a blocking algorithm for computing large one-dimensional fast Fourier transform (FFT) on cache-based processors. Our proposed FFT algorithm is based on the six-step FFT algorithm. We show that the block six-step FFT algorithm improves performance by effectively utilizing the cache memory. Performance results of one-dimensional FFTs on the Sun Ultra 10 and PentiumIII PC are reported. We succeeded in obtaining performance of about 108MFLOPS on the Sun Ultra 10 (UltraSPARC-IIi 333MHz) and about 247MFLOPS on the 1GHz PentiumIII PC for 220-point FFT.