arXiv · hep-lat/9710060
FFT for the APE Parallel Computer
Abstract
We present a parallel FFT algorithm for SIMD systems following the `Transpose Algorithm' approach. The method is based on the assignment of the data field onto a 1-dimensional ring of systolic cells. The systolic array can be universally mapped onto any parallel system. In particular for systems with next-neighbour connectivity our method has the potential to improve the efficiency of matrix transposition by use of hyper-systolic communication. We have realized a scalable parallel FFT on the APE100/Quadrics massively parallel computer, where our implementation is part of a 2-dimensional hydrodynamics code for turbulence studies. A possible generalization to 4-dimensional FFT is presented, having in mind QCD applications.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Thomas Lippert, Klaus Schilling, Federico Toschi, Sven Trentmann, Raffaele Tripiccione. 1997-10-16. FFT for the APE Parallel Computer. https://doi.org/10.1142/s012918319700117x
Cite the original work for its findings. Save a collection to share your selection of sources.