Year: 1998
Type: article
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.
Source: Parallel Computing
Authors: Thomas H. Cormen, David M. Nicol
Institution: Dartmouth College
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,870
Awards: G2461630731, Research Initiation Award: Virtual Memory for Data-Parallel Computing, MDC: Simulations of Integrated Communications Systems, Static and Dynamic Load Balancing of Parallel Discrete-Event Simulation on Distributed Memory Architectures, ViC*: A Compiler and Runtime System for Out-of-Core C*
OpenAlex ID: W1967663460