Multiprocessor FFTs (Q578884): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1297751 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Guy Jumaric / rank | |||
Normal rank | |||
Revision as of 17:24, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiprocessor FFTs |
scientific article |
Statements
Multiprocessor FFTs (English)
0 references
1987
0 references
Several vector component fast Fourier transforms (FFT) are developed for both shared and non-shared multiprocessors. The focus is mainly on the efficiency of the movement of data. First eight FFTs algorithms are reviewed and then they are used to develop two FFTs for vector multiprocessors with shared memory. In the case of the hypercube FFTs, the emphasis is on algorithms which minimize interprocessors communication.
0 references
fast Fourier transforms
0 references
multiprocessors
0 references
algorithms
0 references
shared memory
0 references
hypercube FFTs
0 references
