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

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

doi:10.1142/s0129626494000442

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 journal › Article › peer-review

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 language	English (US)
Pages (from-to)	477-488
Number of pages	12
Journal	Parallel processing letters
Volume	4
Issue number	4
DOIs	https://doi.org/10.1142/s0129626494000442
State	Published - 1994
Externally published	Yes

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture

Access to Document

10.1142/s0129626494000442

Cite this

@article{f8d7529c4f604b2787d17593ecb922b9,

title = "Implementing fast Fourier transforms on distributed-memory multiprocessors using data redistributions",

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.",

author = "Gupta, {S. K.S.} and Huang, {C. H.} and P. Sadayappan and Johnson, {R. W.}",

year = "1994",

doi = "10.1142/s0129626494000442",

language = "English (US)",

volume = "4",

pages = "477--488",

journal = "Parallel processing letters",

issn = "0129-6264",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "4",

}

TY - JOUR

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

AU - Gupta, S. K.S.

AU - Huang, C. H.

AU - Sadayappan, P.

AU - Johnson, R. W.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028713640&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028713640&partnerID=8YFLogxK

U2 - 10.1142/s0129626494000442

DO - 10.1142/s0129626494000442

M3 - Article

AN - SCOPUS:0028713640

SN - 0129-6264

VL - 4

SP - 477

EP - 488

JO - Parallel processing letters

JF - Parallel processing letters

IS - 4

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this