Algorithms for Parallel Processing

Volume 105 of the series The IMA Volumes in Mathematics and its Applications pp 307-320

Determining an out-of-Core FFT Decomposition Strategy for Parallel Disks by Dynamic Programming

  • Thomas H. CormenAffiliated withDepartment of Computer Science, Dartmouth College

* Final gross prices may vary according to local VAT.

Get Access


We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. Our algorithm uses a recursive divide-and-conquer strategy, and each stage in the recursion presents several possibilities for how to split the problem into subproblems. We give a recurrence for the algorithm’s I/O complexity on the Parallel Disk Model and show how to use dynamic programming to determine optimal splits at each recursive stage. The algorithm to determine the optimal splits takes only Θ(lg2 N) time for an N-point FFT, and it is practical. The out-of-core FFT algorithm itself takes considerably longer.