A parallel FFT algorithm for transputer networks (Q1180606)
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: A parallel FFT algorithm for transputer networks |
scientific article; zbMATH DE number 26108
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel FFT algorithm for transputer networks |
scientific article; zbMATH DE number 26108 |
Statements
A parallel FFT algorithm for transputer networks (English)
0 references
27 June 1992
0 references
A parallel fast Fourier transform (FFT) algorithm suitable for MIMD machines is presented. The algorithm relies on sending the columns of a matrix to nodes for execution of butterfly operations over a network. It has certain features: Each node performs identical computational task; computation proceeds with no need of intervention from outside; increased efficiency with large size matrices. The algorithm is implemented for tree and cubic types of transputer networks in Occam language. A set of performance figures is derived for different size of networks and initial matrices.
0 references
parallel algorithms
0 references
cubic topology
0 references
tree topology
0 references
fast Fourier transform
0 references
MIMD machines
0 references
transputer networks
0 references
Occam language
0 references
performance
0 references
0.91529167
0 references
0.9138515
0 references
0.9075053
0 references
0 references
0.9061144
0 references
