PFFT: An Extension of FFTW to Massively Parallel Architectures
| Autor: | Michael Pippig |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Complex data type
parallel Fourier transform MPI FFT ddc:518 65T50 65Y05 Computer science business.industry Applied Mathematics Fast Fourier transform Process (computing) Parallel computing parallel Fourier-Transformation MPI FFT Computational Mathematics Software Transpose Polygon mesh Distributed memory ddc:004 business Schnelle Fourier-Transformation MPI Parallelverarbeitung Massively parallel |
| Zdroj: | SIAM Journal on Scientific Computing. 35:C213-C236 |
| ISSN: | 1095-7197 1064-8275 |
| Popis: | We present an MPI based software library for computing fast Fourier transforms (FFTs) on massively parallel, distributed memory architectures based on the Message Passing Interface standard (MPI). Similar to established transpose FFT algorithms, we propose a parallel FFT framework that is based on a combination of local FFTs, local data permutations, and global data transpositions. This framework can be generalized to arbitrary multidimensional data and process meshes. All performance-relevant building blocks can be implemented with the help of the FFTW software library. Therefore, our library offers great flexibility and portable performance. Similarly to FFTW, we are able to compute FFTs of complex data, real data, and even- or odd-symmetric real data. All the transforms can be performed completely in place. Furthermore, we propose an algorithm to calculate pruned FFTs more efficiently on distributed memory architectures. For example, we provide performance measurements of FFTs of sizes between $512^3$ ... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|