Shared memory multiprocessors with cache require careful consideration of cache parameters while implementing an algorithm to obtain optimal performance. In this paper, we study the implementation of some existing FFT algorithms and analyze the number of cache misses based on the problem size, number of processors, cache size, and block size. We also propose a new FFT algorithm which minimizes the number of cache misses.
['Akhilesh Kumar', 'Laxmi N. Bhuyan']
Parallel FFT Algorithms for Cache Based Shared Memory Multiprocessors