Multiprocessor FFTs (Q578884): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65T40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 42A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65Y05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4013983 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fast Fourier transforms | |||
Property / zbMATH Keywords: fast Fourier transforms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiprocessors | |||
Property / zbMATH Keywords: multiprocessors / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithms | |||
Property / zbMATH Keywords: algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
shared memory | |||
Property / zbMATH Keywords: shared memory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hypercube FFTs | |||
Property / zbMATH Keywords: hypercube FFTs / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Guy Jumaric / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-8191(87)90018-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4256206162 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:54, 19 March 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