TY  - CONF
AU  - Lippert, Th.
AU  - Schilling, K.
AU  - Toschi, F.
AU  - Trentmann, S.
AU  - Tripiccione, R.
TI  - Transpose algorithm for FFT on APE/Quadrics
VL  - 1401
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
M1  - FZJ-2019-01119
SN  - 978-3-540-64443-9 (print)
T2  - Lecture Notes in Computer Science
SP  - 439 - 448
PY  - 1998
AB  - 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.
T2  - International Conference on High-Performance Computing and Networking
CY  - 21 Apr 1998 - 23 Apr 1998, Amsterdam (The Netherlands)
Y2  - 21 Apr 1998 - 23 Apr 1998
M2  - Amsterdam, The Netherlands
LB  - PUB:(DE-HGF)8 ; PUB:(DE-HGF)7
DO  - DOI:10.1007/BFb0037171
UR  - https://juser.fz-juelich.de/record/860344
ER  -