Name
Abstract | ||
|---|---|---|
We describe a novel practical parallel FFT scheme designed for SIMD systems and/or data parallel programming. A bit-exchange of elements between the processors is avoided by means of the Transpose Algorithm. Our transposition is based on the assignment of the data field onto a 1-dimensional ring of systolic cells which subsequently is mapped onto a ring of processors, realized as a subset of the system's connectivity. We have implemented and benchmarked a 2-dimensional parallel FFT code on the APE100/Quadrics parallel computer, where–due to a rigid next-neighbour connectivity and lack of local addressing–efficient FFT implementations could not be realized so far. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0037171 | HPCN Europe |
Keywords | Field | DocType |
transpose algorithm,parallel computer,1 dimensional,2 dimensional | Data field,Split-radix FFT algorithm,Matrix calculus,Transpose,Computer science,Parallel algorithm,Parallel computing,Systolic array,Algorithm,SIMD,Fast Fourier transform | Conference |
Volume | ISSN | ISBN |
1401 | 0302-9743 | 3-540-64443-1 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Lippert | 1 | 0 | 0.34 |
| Klaus Schilling | 2 | 17 | 7.27 |
| F. Toschi | 3 | 0 | 0.34 |
| S. Trentmann | 4 | 0 | 0.34 |
| R. Tripiccione | 5 | 73 | 12.68 |