Document Type
Technical Report
Publication Date
8-1-1997
Technical Report Number
PCS-TR96-294
Abstract
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems can be solved entirely in main memory, some important classes of applications require out-of-core techniques. For these, use of parallel I/O systems can improve performance considerably. This paper shows how to perform one-dimensional FFTs using a parallel disk system with independent disk accesses. We present both analytical and experimental results for performing out-of-core FFTs in two ways: using traditional virtual memory with demand paging, and using a provably asymptotically optimal algorithm for the Parallel Disk Model (PDM) of Vitter and Shriver. When run on a DEC 2100 server with a large memory and eight parallel disks, the optimal algorithm for the PDM runs up to 144.7 times faster than in-core methods under demand paging. Moreover, even including I/O costs, the normalized times for the optimal PDM algorithm are competitive, or better than, those for in-core methods even when they run entirely in memory.
Dartmouth Digital Commons Citation
Cormen, Thomas H. and Nicol, David M., "Performing Out-of-Core FFTs on Parallel Disk Systems" (1997). Computer Science Technical Report PCS-TR96-294. https://digitalcommons.dartmouth.edu/cs_tr/136
Comments
Similar paper to appear in Parallel Computing. Original version August 7, 1996; revised September 6, 1996 and August 14, 1997.