@Article{cormen:fft,
  author = {Thomas H. Cormen and David M. Nicol},
  title = {Performing Out-of-Core {FFTs} on Parallel Disk Systems},
  journal = {Parallel Computing},
  year = {1998},
  month = {January},
  volume = {24},
  number = {1},
  pages = {5--20},
  publisher = {North-Holland},
  copyright = {North-Holland},
  earlier = {cormen:fft-tr},
  keywords = {parallel I/O, out of core, scientific computing, FFT, pario-bib},
  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 I.S. Vitter and E.A.M. Shriver (1994). 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.},
  comment = {see also cormen:fft2 and cormen:fft3. Part of a special issue.}
}