A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers

Abstract

In this paper, we propose a blocking algorithm for parallel one-dimensional fast Fourier transform (FFT) on shared-memory parallel computers. Our proposed FFT algorithm is based on the six-step FFT algorithm. The block six-step FFT algorithm improves performance by effectively utilizing the cache memory. Performance results of onedimensional FFTs on the SGI Onyx 3400 and Sun Enterprise 6000 are reported. We successfully achieved performance of about 1929MFLOPS on the SGI Onyx 3400 (MIPS R12000 400 MHz, 16 CPUs) and about 520MFLOPS on the Sun Enterprise 6000 (UltraSPARC 168 MHz, 16 CPUs).