After recalling the significance of Fourier transforms, the algebraic importance of the discrete Fourier transform, and the O(n log(n)) running time of the fast Fourier transform, we introduced the isoefficiency function as a third tool to evaluate the performance of parallel algorithms. We derived the isoefficiency function for the parallel FFT, showing its scalability.
Bibliography