A General Purpose Subroutine for Fast Fourier Transform on a Distributed Memory Parallel Machine

Abstract

One issue that is central in developing a general purpose Fast Fourier Transform (FFT) subroutine on a distributed memory parallel machine is the data distribution. It is possible that different users would like to use the FFT routine with different data distributions. Thus, there is a need to design FFT schemes on distributed memory parallel machines that can support a variety of data distributions. In this paper, the authors present an FFT implementation on a distributed memory parallel machine that works for a number of data distributions commonly encountered in scientific applications. The authors also have addressed the problem of rearranging the data after computing the FFT. They evaluated the performance of their implementation on a distributed memory parallel machine: Intel iPSC/860.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1992
Accession Number
ADA258985

Entities

People

  • Anamika Dubey
  • C. E . Grosch
  • M. Zubair

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Aeronautics
  • Algorithms
  • Complex Numbers
  • Computations
  • Computer Science
  • Computers
  • Contracts
  • Differential Equations
  • Engineering
  • Equations
  • Fast Fourier Transforms
  • Lepidoptera
  • Numbers
  • Numerical Analysis
  • Partial Differential Equations
  • Procedures (Computers)
  • Sequences

Readers

  • Parallel and Distributed Computing.