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