Implementing fast Fourier transforms on distributed-memory multiprocessors using data redistributions

S. K.S. Gupta, C. H. Huang, P. Sadayappan, R. W. Johnson

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

Implementations of various fast Fourier transform (FFT) algorithms are presented for distributed-memory multiprocessors. These algorithms use data redistribution to localize the computation. The goal is to optimize communication cost by using a minimum number of redistribution steps. Both analytical and experimental performance results on the Intel iPSC/860 system are presented.

Original languageEnglish (US)
Pages (from-to)477-488
Number of pages12
JournalParallel processing letters
Volume4
Issue number4
DOIs
StatePublished - Jan 1 1994
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Implementing fast Fourier transforms on distributed-memory multiprocessors using data redistributions'. Together they form a unique fingerprint.

  • Cite this