Chris@82: Next: MPI Wisdom Communication, Previous: MPI Data Distribution Functions, Up: FFTW MPI Reference [Contents][Index]
Chris@82:Plans for complex-data DFTs (see 2d MPI example) are created by: Chris@82:
Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82:fftw_plan fftw_mpi_plan_dft_1d(ptrdiff_t n0, fftw_complex *in, fftw_complex *out, Chris@82: MPI_Comm comm, int sign, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_2d(ptrdiff_t n0, ptrdiff_t n1, Chris@82: fftw_complex *in, fftw_complex *out, Chris@82: MPI_Comm comm, int sign, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_3d(ptrdiff_t n0, ptrdiff_t n1, ptrdiff_t n2, Chris@82: fftw_complex *in, fftw_complex *out, Chris@82: MPI_Comm comm, int sign, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft(int rnk, const ptrdiff_t *n, Chris@82: fftw_complex *in, fftw_complex *out, Chris@82: MPI_Comm comm, int sign, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_many_dft(int rnk, const ptrdiff_t *n, Chris@82: ptrdiff_t howmany, ptrdiff_t block, ptrdiff_t tblock, Chris@82: fftw_complex *in, fftw_complex *out, Chris@82: MPI_Comm comm, int sign, unsigned flags); Chris@82:
These are similar to their serial counterparts (see Complex DFTs)
Chris@82: in specifying the dimensions, sign, and flags of the transform. The
Chris@82: comm argument gives an MPI communicator that specifies the set
Chris@82: of processes to participate in the transform; plan creation is a
Chris@82: collective function that must be called for all processes in the
Chris@82: communicator. The in and out pointers refer only to a
Chris@82: portion of the overall transform data (see MPI Data Distribution)
Chris@82: as specified by the ‘local_size’ functions in the previous
Chris@82: section. Unless flags contains FFTW_ESTIMATE, these
Chris@82: arrays are overwritten during plan creation as for the serial
Chris@82: interface. For multi-dimensional transforms, any dimensions >
Chris@82: 1 are supported; for one-dimensional transforms, only composite
Chris@82: (non-prime) n0 are currently supported (unlike the serial
Chris@82: FFTW). Requesting an unsupported transform size will yield a
Chris@82: NULL plan. (As in the serial interface, highly composite sizes
Chris@82: generally yield the best performance.)
Chris@82:
The advanced-interface fftw_mpi_plan_many_dft additionally
Chris@82: allows you to specify the block sizes for the first dimension
Chris@82: (block) of the n0 × n1 × n2 × … × nd-1
Chris@82: input data and the first dimension
Chris@82: (tblock) of the n1 × n0 × n2 ×…× nd-1
Chris@82: transposed data (at intermediate
Chris@82: steps of the transform, and for the output if
Chris@82: FFTW_TRANSPOSED_OUT is specified in flags). These must
Chris@82: be the same block sizes as were passed to the corresponding
Chris@82: ‘local_size’ function; you can pass FFTW_MPI_DEFAULT_BLOCK
Chris@82: to use FFTW’s default block size as in the basic interface. Also, the
Chris@82: howmany parameter specifies that the transform is of contiguous
Chris@82: howmany-tuples rather than individual complex numbers; this
Chris@82: corresponds to the same parameter in the serial advanced interface
Chris@82: (see Advanced Complex DFTs) with stride = howmany and
Chris@82: dist = 1.
Chris@82:
The flags can be any of those for the serial FFTW
Chris@82: (see Planner Flags), and in addition may include one or more of
Chris@82: the following MPI-specific flags, which improve performance at the
Chris@82: cost of changing the output or input data formats.
Chris@82:
FFTW_MPI_SCRAMBLED_OUT, FFTW_MPI_SCRAMBLED_IN: valid for
Chris@82: 1d transforms only, these flags indicate that the output/input of the
Chris@82: transform are in an undocumented “scrambled” order. A forward
Chris@82: FFTW_MPI_SCRAMBLED_OUT transform can be inverted by a backward
Chris@82: FFTW_MPI_SCRAMBLED_IN (times the usual 1/N normalization).
Chris@82: See One-dimensional distributions.
Chris@82:
Chris@82: FFTW_MPI_TRANSPOSED_OUT, FFTW_MPI_TRANSPOSED_IN: valid
Chris@82: for multidimensional (rnk > 1) transforms only, these flags
Chris@82: specify that the output or input of an n0 × n1 × n2 × … × nd-1
Chris@82: transform is
Chris@82: transposed to n1 × n0 × n2 ×…× nd-1
Chris@82: . See Transposed distributions.
Chris@82:
Chris@82: Plans for real-input/output (r2c/c2r) DFTs (see Multi-dimensional MPI DFTs of Real Data) are created by: Chris@82:
Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82:fftw_plan fftw_mpi_plan_dft_r2c_2d(ptrdiff_t n0, ptrdiff_t n1, Chris@82: double *in, fftw_complex *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_r2c_2d(ptrdiff_t n0, ptrdiff_t n1, Chris@82: double *in, fftw_complex *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_r2c_3d(ptrdiff_t n0, ptrdiff_t n1, ptrdiff_t n2, Chris@82: double *in, fftw_complex *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_r2c(int rnk, const ptrdiff_t *n, Chris@82: double *in, fftw_complex *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_c2r_2d(ptrdiff_t n0, ptrdiff_t n1, Chris@82: fftw_complex *in, double *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_c2r_2d(ptrdiff_t n0, ptrdiff_t n1, Chris@82: fftw_complex *in, double *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_c2r_3d(ptrdiff_t n0, ptrdiff_t n1, ptrdiff_t n2, Chris@82: fftw_complex *in, double *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_dft_c2r(int rnk, const ptrdiff_t *n, Chris@82: fftw_complex *in, double *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82:
Similar to the serial interface (see Real-data DFTs), these
Chris@82: transform logically n0 × n1 × n2 × … × nd-1
Chris@82: real data to/from n0 × n1 × n2 × … × (nd-1/2 + 1)
Chris@82: complex
Chris@82: data, representing the non-redundant half of the conjugate-symmetry
Chris@82: output of a real-input DFT (see Multi-dimensional Transforms).
Chris@82: However, the real array must be stored within a padded n0 × n1 × n2 × … × [2 (nd-1/2 + 1)]
Chris@82:
Chris@82: array (much like the in-place serial r2c transforms, but here for
Chris@82: out-of-place transforms as well). Currently, only multi-dimensional
Chris@82: (rnk > 1) r2c/c2r transforms are supported (requesting a plan
Chris@82: for rnk = 1 will yield NULL). As explained above
Chris@82: (see Multi-dimensional MPI DFTs of Real Data), the data
Chris@82: distribution of both the real and complex arrays is given by the
Chris@82: ‘local_size’ function called for the dimensions of the
Chris@82: complex array. Similar to the other planning functions, the
Chris@82: input and output arrays are overwritten when the plan is created
Chris@82: except in FFTW_ESTIMATE mode.
Chris@82:
As for the complex DFTs above, there is an advance interface that
Chris@82: allows you to manually specify block sizes and to transform contiguous
Chris@82: howmany-tuples of real/complex numbers:
Chris@82:
fftw_plan fftw_mpi_plan_many_dft_r2c Chris@82: (int rnk, const ptrdiff_t *n, ptrdiff_t howmany, Chris@82: ptrdiff_t iblock, ptrdiff_t oblock, Chris@82: double *in, fftw_complex *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_many_dft_c2r Chris@82: (int rnk, const ptrdiff_t *n, ptrdiff_t howmany, Chris@82: ptrdiff_t iblock, ptrdiff_t oblock, Chris@82: fftw_complex *in, double *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82:
There are corresponding plan-creation routines for r2r
Chris@82: transforms (see More DFTs of Real Data), currently supporting
Chris@82: multidimensional (rnk > 1) transforms only (rnk = 1 will
Chris@82: yield a NULL plan):
Chris@82:
fftw_plan fftw_mpi_plan_r2r_2d(ptrdiff_t n0, ptrdiff_t n1, Chris@82: double *in, double *out, Chris@82: MPI_Comm comm, Chris@82: fftw_r2r_kind kind0, fftw_r2r_kind kind1, Chris@82: unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_r2r_3d(ptrdiff_t n0, ptrdiff_t n1, ptrdiff_t n2, Chris@82: double *in, double *out, Chris@82: MPI_Comm comm, Chris@82: fftw_r2r_kind kind0, fftw_r2r_kind kind1, fftw_r2r_kind kind2, Chris@82: unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_r2r(int rnk, const ptrdiff_t *n, Chris@82: double *in, double *out, Chris@82: MPI_Comm comm, const fftw_r2r_kind *kind, Chris@82: unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_many_r2r(int rnk, const ptrdiff_t *n, Chris@82: ptrdiff_t iblock, ptrdiff_t oblock, Chris@82: double *in, double *out, Chris@82: MPI_Comm comm, const fftw_r2r_kind *kind, Chris@82: unsigned flags); Chris@82:
The parameters are much the same as for the complex DFTs above, except
Chris@82: that the arrays are of real numbers (and hence the outputs of the
Chris@82: ‘local_size’ data-distribution functions should be interpreted as
Chris@82: counts of real rather than complex numbers). Also, the kind
Chris@82: parameters specify the r2r kinds along each dimension as for the
Chris@82: serial interface (see Real-to-Real Transform Kinds). See Other Multi-dimensional Real-data MPI Transforms.
Chris@82:
FFTW also provides routines to plan a transpose of a distributed
Chris@82: n0 by n1 array of real numbers, or an array of
Chris@82: howmany-tuples of real numbers with specified block sizes
Chris@82: (see FFTW MPI Transposes):
Chris@82:
fftw_plan fftw_mpi_plan_transpose(ptrdiff_t n0, ptrdiff_t n1, Chris@82: double *in, double *out, Chris@82: MPI_Comm comm, unsigned flags); Chris@82: fftw_plan fftw_mpi_plan_many_transpose Chris@82: (ptrdiff_t n0, ptrdiff_t n1, ptrdiff_t howmany, Chris@82: ptrdiff_t block0, ptrdiff_t block1, Chris@82: double *in, double *out, MPI_Comm comm, unsigned flags); Chris@82:
These plans are used with the fftw_mpi_execute_r2r new-array
Chris@82: execute function (see Using MPI Plans), since they count as (rank
Chris@82: zero) r2r plans from FFTW’s perspective.
Chris@82:
Chris@82: Next: MPI Wisdom Communication, Previous: MPI Data Distribution Functions, Up: FFTW MPI Reference [Contents][Index]
Chris@82: