%0 Conference Paper
%A Lippert, Th.
%A Schilling, K.
%A Toschi, F.
%A Trentmann, S.
%A Tripiccione, R.
%T Transpose algorithm for FFT on APE/Quadrics
%V 1401
%C Berlin, Heidelberg
%I Springer Berlin Heidelberg
%M FZJ-2019-01119
%@ 978-3-540-64443-9 (print)
%B Lecture Notes in Computer Science
%P 439 - 448
%D 1998
%< High-Performance Computing and Networking / Sloot, Peter (Editor)   ; Berlin, Heidelberg : Springer Berlin Heidelberg, 1998, Chapter 46 ; ISSN: 0302-9743=1611-3349 ; ISBN: 978-3-540-64443-9=978-3-540-69783-1 ; doi:10.1007/BFb0037125
%X 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.
%B International Conference on High-Performance Computing and Networking
%C 21 Apr 1998 - 23 Apr 1998, Amsterdam (The Netherlands)
Y2 21 Apr 1998 - 23 Apr 1998
M2 Amsterdam, The Netherlands
%F PUB:(DE-HGF)8 ; PUB:(DE-HGF)7
%9 Contribution to a conference proceedingsContribution to a book
%R 10.1007/BFb0037171
%U https://juser.fz-juelich.de/record/860344