No label defined (Q4723256)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997125 |
Statements
1986
0 references
discrete Fourier transform
0 references
fast Fourier transform
0 references
MIMD system
0 references
trigonometric functions
0 references
NEPTUNE system
0 references
0 references
0.9742552
0 references
0.9654814
0 references
0.9279815
0 references
0.92621845
0 references
0.9244091
0 references
0.92069995
0 references
[For the entire collection see Zbl 0608.00015.] An algorithm for the parallel operation of the fast Fourier transform (FFT) for a MIMD system is presented. With reasonable memory requirements, the algorithm attempts to avoid the repeated calculations of trigonometric functions and the frequent accesses to critical regions in the process of re-ordering the points. The program has been tested on the NEPTUNE system and the results and analysis of timings are presented. This algorithm can be executed by any number of processors, but generally the number is much less than the N data. In the case that the number of processors is a power of two, an even more effective algorithm can be designed.
0 references