Parallel FFT with Eden Skeletons

Authors:
Jost Berthold;Mischa Dieterle;Oleg Lobachev;Rita Loogen
Affiliations:
Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Marburg, Germany D-35032;Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Marburg, Germany D-35032;Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Marburg, Germany D-35032;Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Marburg, Germany D-35032
Venue:
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Year:
2009

Citing 7
Cited 4

Algorithmic skeletons: structured management of parallel computation

Algorithmic skeletons: structured management of parallel computation
Programming with Divide-and-Conquer Skeletons: A Case Study of FFT

The Journal of Supercomputing
An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
Controlling parallelism and data distribution in Eden

Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00)
Parallelism abstractions in eden

Patterns and skeletons for parallel and distributed computing
Parallel functional programming in Eden

Journal of Functional Programming
Towards an Implementation of a Computer Algebra System in a Functional Language

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics

The Peter Landin prize

Higher-Order and Symbolic Computation
Skeleton composition using remote data

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Verification of a heat diffusion simulation written with orléans skeleton library

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Eden --- parallel functional programming with haskell

CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper investigates and compares skeleton-based Eden implementations of different FFT-algorithms on workstation clusters with distributed memory. Our experiments show that the basic divide-and-conquer versions suffer from an inherent input distribution and result collection problem. Advanced approaches like calculating FFT using a parallel map-and-transpose skeleton provide more flexibility to overcome these problems. Assuming a distributed access to input data and re-organising computation to return results in a distributed way improves the parallel runtime behaviour.