Communication efficient multi-processor FFT (Q1201720): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1087579 |
||
| Property / reviewed by | |||
| Property / reviewed by: Gabriele Drauschke / rank | |||
Revision as of 05:38, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Communication efficient multi-processor FFT |
scientific article |
Statements
Communication efficient multi-processor FFT (English)
0 references
17 January 1993
0 references
The main contribution of the paper are communication efficient multiprocessor algorithms for the Cooley-Tukey fast Fourier transform (FFT). The discussed algorithms are also efficient in the use of storage for twiddle factors and in the use of the bandwidth between each processor and its memory. The impact on performance of different data layouts is evaluated. Finally, results from implementations on the connection machine system CM-200 are presented.
0 references
Boolean cube networks
0 references
efficient multiprocessor algorithms
0 references
fast Fourier transform
0 references
