A parallel FFT algorithm for transputer networks
| Autor: | Yonggen Huang, Yakup Paker |
|---|---|
| Rok vydání: | 1991 |
| Předmět: |
Computer Networks and Communications
Computer science Computation Transputer Fast Fourier transform Parallel algorithm occam Parallel computing Computer Graphics and Computer-Aided Design Theoretical Computer Science Set (abstract data type) MIMD Tree (data structure) Matrix (mathematics) Artificial Intelligence Hardware and Architecture computer Software computer.programming_language |
| Zdroj: | Parallel Computing. 17:895-906 |
| ISSN: | 0167-8191 |
| Popis: | This paper presents a parallel FFT algorithm suitable for MIMD machines. It has the properties of uniform granularity, the dominance of computation, and suitability to large data matrices. The algorithm has been implemented for a tree and cubic types of transputer network in Occam language. A set of performance figures has been derived for different size of networks and initial matrices. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|