Optimized multicore architectures for data parallel fast Fourier transform

2013 ◽  
Author(s):  
Thomas Canhao Xu ◽  
Tapio Pahikkala ◽  
Pasi Liljeberg ◽  
Juha Plosila ◽  
Hannu Tenhunen
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Multicore Architectures ◽  
Data Parallel

A Generic MPI Implementation for a Data-Parallel Skeleton: Formal Derivation and Application to FFT

1998 ◽  
Vol 08 (04) ◽  
pp. 447-458 ◽  
Author(s):  
Sergei Gorlatch ◽  
Holger Bischof
Keyword(s):  
Fourier Transform ◽  
Parallel Algorithms ◽  
Fast Fourier Transform ◽  
Independent Family ◽  
Data Parallel ◽  
Formal Derivation ◽  
Special Cases ◽  
Target Program ◽  
Mpi Implementation

We derive a provably correct, architecture-independent family of parallel implementations for a class of data-parallel algorithms, called DH (distributable homomorphisms). The implementations are well-structured SPMD programs with group-wise personalized all-to-all exchange, directly realizable in MPI. As a case study, we systematically adjust the mathematical specification of the Fast Fourier Transform (FFT) to the DH format and, thereby, obtain a generic SPMD implementation for FFT. The target program includes FFT solutions used in practice – the binary-exchange and the 2D- and SD-transpose – as special cases.

Sign in / Sign up

Export Citation Format

Share Document