Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2)

Mahn Ling Woo; Rosemary Renaut

doi:10.1145/326619.326903

Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2)

Mahn Ling Woo, Rosemary Renaut

CLAS-NS: Mathematical and Statistical Sciences, School of (SMSS)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Algorithms for unordered Parallel Fast Fourier transform (PFFT) pairs with radices 2 and mixed radix (4-2) for distributed memory machines are presented. Distributed memory versions using distance one and distance two communications are derived. Theoretical estimates of the computation costs in each case demonstrate that the higher-radix FFT is more efficient for parallel implementation. Furthermore, distance-Two communication strategies can minimise com-munication cost, when certain architecture dependent parameters are satisfied.

Original language	English (US)
Title of host publication	Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994
Publisher	Association for Computing Machinery
Pages	504-509
Number of pages	6
Volume	Part F129433
ISBN (Electronic)	0897916476
DOIs	https://doi.org/10.1145/326619.326903
State	Published - Apr 6 1994
Event	1994 ACM Symposium on Applied Computing, SAC 1994 - Phoenix, United States Duration: Mar 6 1994 → Mar 8 1994

Other

Other	1994 ACM Symposium on Applied Computing, SAC 1994
Country/Territory	United States
City	Phoenix
Period	3/6/94 → 3/8/94

Keywords

Complexity analysis
Mixed-radix (4-2) FFT
Parallel FFT algorithms
Radix-2 FFT

ASJC Scopus subject areas

Software

Access to Document

10.1145/326619.326903

Cite this

Woo, ML & Renaut, R 1994, Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2). in Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994. vol. Part F129433, Association for Computing Machinery, pp. 504-509, 1994 ACM Symposium on Applied Computing, SAC 1994, Phoenix, United States, 3/6/94. https://doi.org/10.1145/326619.326903

@inproceedings{6697e7db987d405ab7e52c524b3f9cea,

title = "Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2)",

abstract = "Algorithms for unordered Parallel Fast Fourier transform (PFFT) pairs with radices 2 and mixed radix (4-2) for distributed memory machines are presented. Distributed memory versions using distance one and distance two communications are derived. Theoretical estimates of the computation costs in each case demonstrate that the higher-radix FFT is more efficient for parallel implementation. Furthermore, distance-Two communication strategies can minimise com-munication cost, when certain architecture dependent parameters are satisfied.",

keywords = "Complexity analysis, Mixed-radix (4-2) FFT, Parallel FFT algorithms, Radix-2 FFT",

author = "Woo, {Mahn Ling} and Rosemary Renaut",

year = "1994",

month = apr,

day = "6",

doi = "10.1145/326619.326903",

language = "English (US)",

volume = "Part F129433",

pages = "504--509",

booktitle = "Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994",

publisher = "Association for Computing Machinery",

note = "1994 ACM Symposium on Applied Computing, SAC 1994 ; Conference date: 06-03-1994 Through 08-03-1994",

}

TY - GEN

T1 - Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2)

AU - Woo, Mahn Ling

AU - Renaut, Rosemary

PY - 1994/4/6

Y1 - 1994/4/6

N2 - Algorithms for unordered Parallel Fast Fourier transform (PFFT) pairs with radices 2 and mixed radix (4-2) for distributed memory machines are presented. Distributed memory versions using distance one and distance two communications are derived. Theoretical estimates of the computation costs in each case demonstrate that the higher-radix FFT is more efficient for parallel implementation. Furthermore, distance-Two communication strategies can minimise com-munication cost, when certain architecture dependent parameters are satisfied.

AB - Algorithms for unordered Parallel Fast Fourier transform (PFFT) pairs with radices 2 and mixed radix (4-2) for distributed memory machines are presented. Distributed memory versions using distance one and distance two communications are derived. Theoretical estimates of the computation costs in each case demonstrate that the higher-radix FFT is more efficient for parallel implementation. Furthermore, distance-Two communication strategies can minimise com-munication cost, when certain architecture dependent parameters are satisfied.

KW - Complexity analysis

KW - Mixed-radix (4-2) FFT

KW - Parallel FFT algorithms

KW - Radix-2 FFT

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

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

U2 - 10.1145/326619.326903

DO - 10.1145/326619.326903

M3 - Conference contribution

AN - SCOPUS:85039428079

VL - Part F129433

SP - 504

EP - 509

BT - Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994

PB - Association for Computing Machinery

T2 - 1994 ACM Symposium on Applied Computing, SAC 1994

Y2 - 6 March 1994 through 8 March 1994

ER -

Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2)

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this