Faster FFTs via Architecture-Cognizance
Kang Su Gatlin, Larry Carter · 2000
algorithms in computational science, accounting for large amounts of computing time. One major problem with modem FFT implementations is that they poorly scale to large problem. As the problem size increases, stride and associativity effects play a larger role. The result is a severe drop-off in performance.