Algorithms for Parallel Processing
Volume 105 of the series The IMA Volumes in Mathematics and its Applications pp 307320
Determining an outofCore FFT Decomposition Strategy for Parallel Disks by Dynamic Programming
 Thomas H. CormenAffiliated withDepartment of Computer Science, Dartmouth College
Abstract
We present an outofcore FFT algorithm based on the incore FFT method developed by Swarztrauber. Our algorithm uses a recursive divideandconquer 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 Θ(lg^{2} N) time for an Npoint FFT, and it is practical. The outofcore FFT algorithm itself takes considerably longer.
 Title
 Determining an outofCore FFT Decomposition Strategy for Parallel Disks by Dynamic Programming
 Book Title
 Algorithms for Parallel Processing
 Pages
 pp 307320
 Copyright
 1999
 DOI
 10.1007/9781461215165_14
 Print ISBN
 9781461271758
 Online ISBN
 9781461215165
 Series Title
 The IMA Volumes in Mathematics and its Applications
 Series Volume
 105
 Series ISSN
 09406573
 Publisher
 Springer New York
 Copyright Holder
 Springer Science+Business Media New York
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Michael T. Heath ^{(2)}
 Abhiram Ranade ^{(3)}
 Robert S. Schreiber ^{(4)}
 Editor Affiliations

 2. Department of Computer Science, University of Illinois at Urbana
 3. Department of Computer Science and Engineering, Indian Institute of Technology
 4. HewlettPackard, Inc.
 Authors

 Thomas H. Cormen ^{(5)}
 Author Affiliations

 5. Department of Computer Science, Dartmouth College, Hanover, NH, 03755, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.