Communication efficient multi-processor FFT (Q1201720)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Communication efficient multi-processor FFT |
scientific article; zbMATH DE number 98377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication efficient multi-processor FFT |
scientific article; zbMATH DE number 98377 |
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
0 references
0.8815751671791077
0 references
0.8781508207321167
0 references
0.8596341013908386
0 references
0.8422003984451294
0 references
0.8422003984451294
0 references
