Parallel FFT with Eden Skeletons

The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT plays a major role both for pure mathematical applications and for real-life scenarios such as digital signal processing. The paper investigates and compares skeletonbased parallel Haskell implementations of different FFT-algorithms on workstation clusters with distributed memory. Our experiments show that the original divide-and-conquer versions suffer from an inherent input distribution and result collection problem, because huge amounts of data have to be communicated. Advanced approaches like distributable homomorphism FFT or multidimensional FFT provide more flexibility to overcome these problems. Assuming a distributed access to input data and re-organising computation in such a way that the results can be returned in a distributed way leads to versions with an acceptable parallel runtime behaviour. Ke...

• Type: Conference
• Year: 2009
• Where: PACT
• Authors: Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rita Loogen
• Keywords: Discrete Fourier Transformation, Distributed And Parallel Computing, Fast Fourier Transformation, Fourier Transformation, PACT 2009