Performing Out-of-Core FFTS on Parallel Disk Systems.

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 input output 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1996
Accession Number
ADA321329

Entities

People

  • David M. Nicol
  • Thomas H. Cormen

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Complex Numbers
  • Computational Science
  • Computations
  • Computer Science
  • Computers
  • Data Sets
  • Engineering
  • Fast Fourier Transforms
  • Floating Point Operations
  • Fourier Analysis
  • Lepidoptera
  • Machines
  • Mathematics
  • Numbers
  • Operating Systems
  • Permutations

Readers

  • Linear Algebra
  • Parallel and Distributed Computing.