Shalaby, Nadia2016-03-041996Shalaby, Nadia. 1996. Efficient Parallel FFTs for Different Computational Models. Harvard Computer Science Group Technical Report TR-17-96.http://nrs.harvard.edu/urn-3:HUL.InstRepos:25691718We select the Fast Fourier Transform (FFT) to demonstrate a methodology for deriving the optimal parallel algorithm according to predetermined performance metrics, within a computational model. Following the vector space framework for parallel permutations, we provide a specification language to capture the algorithm, derive the optimal parallel FFT specification, compute the arithmetic, memory, communication and load{balance complexity metrics, apply the analytical performance evaluation to PRAM, LPRAM, BSP and LogP computational models, and compare with actual performance results.en-USResearch Paper or Report2016-03-04