Parallel Three-Dimensional Fast Fourier Transforms, dubbed P3DFFT, is a library for computing 3D FFTs using 2D (pencil) decomposition. It is written using Fortran with MPI, and is tuned to work on multiple single-CPU systems (up to 32768 of them). It is built to leverage high-performance serial 1D FFT libraries, such as FFTW or ESSL.
|Operating Systems||OS Independent|
Release Notes: This release adds assorted enhancements and bugfixes.
Release Notes: Several small bugs were fixed. When the STRIDE1 option is used, the Fourier-space complex array is now stored in the form (Z,Y,X) rather than (Z,X,Y). The C interface is now more robust, and C++ support is available (in beta phase). A new installation process based on the GNU configure tool is used to facilitate installation on a variety of platforms. The documentation was updated to clarify available options. New examples were added. The project was relocated to Google Project Hosting.
Release Notes: An option has been added to overwrite the (complex) input array when using the complex-to-real transform with FFTW. An option has been added to use data layout using unit-stride on output of the real-to-complex routine, i.e. (Z,X,Y) ordering.
Release Notes: A C interface has been added. More examples have been added: in-place transform and power spectrum calculation. Performance improvements have been made. Ghost cell support was added for nearest-neighbor communication. Several bugs have been fixed.
Release Notes: This version provides accurate treatment of the 0 and N/2 modes in the complex sequence in Fourier space.