cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: FFTW 3.3.5: Basic distributed-transpose interface cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: cannam@127:
cannam@127:

cannam@127: Next: , Previous: , Up: FFTW MPI Transposes   [Contents][Index]

cannam@127:
cannam@127:
cannam@127: cannam@127:

6.7.1 Basic distributed-transpose interface

cannam@127: cannam@127:

In particular, suppose that we have an n0 by n1 array in cannam@127: row-major order, block-distributed across the n0 dimension. To cannam@127: transpose this into an n1 by n0 array block-distributed cannam@127: across the n1 dimension, we would create a plan by calling the cannam@127: following function: cannam@127:

cannam@127:
cannam@127:
fftw_plan fftw_mpi_plan_transpose(ptrdiff_t n0, ptrdiff_t n1,
cannam@127:                                   double *in, double *out,
cannam@127:                                   MPI_Comm comm, unsigned flags);
cannam@127: 
cannam@127: cannam@127: cannam@127:

The input and output arrays (in and out) can be the cannam@127: same. The transpose is actually executed by calling cannam@127: fftw_execute on the plan, as usual. cannam@127: cannam@127:

cannam@127: cannam@127:

The flags are the usual FFTW planner flags, but support cannam@127: two additional flags: FFTW_MPI_TRANSPOSED_OUT and/or cannam@127: FFTW_MPI_TRANSPOSED_IN. What these flags indicate, for cannam@127: transpose plans, is that the output and/or input, respectively, are cannam@127: locally transposed. That is, on each process input data is cannam@127: normally stored as a local_n0 by n1 array in row-major cannam@127: order, but for an FFTW_MPI_TRANSPOSED_IN plan the input data is cannam@127: stored as n1 by local_n0 in row-major order. Similarly, cannam@127: FFTW_MPI_TRANSPOSED_OUT means that the output is n0 by cannam@127: local_n1 instead of local_n1 by n0. cannam@127: cannam@127: cannam@127:

cannam@127: cannam@127:

To determine the local size of the array on each process before and cannam@127: after the transpose, as well as the amount of storage that must be cannam@127: allocated, one should call fftw_mpi_local_size_2d_transposed, cannam@127: just as for a 2d DFT as described in the previous section: cannam@127: cannam@127:

cannam@127:
cannam@127:
ptrdiff_t fftw_mpi_local_size_2d_transposed
cannam@127:                 (ptrdiff_t n0, ptrdiff_t n1, MPI_Comm comm,
cannam@127:                  ptrdiff_t *local_n0, ptrdiff_t *local_0_start,
cannam@127:                  ptrdiff_t *local_n1, ptrdiff_t *local_1_start);
cannam@127: 
cannam@127: cannam@127: cannam@127:

Again, the return value is the local storage to allocate, which in cannam@127: this case is the number of real (double) values rather cannam@127: than complex numbers as in the previous examples. cannam@127:

cannam@127:
cannam@127:
cannam@127:

cannam@127: Next: , Previous: , Up: FFTW MPI Transposes   [Contents][Index]

cannam@127:
cannam@127: cannam@127: cannam@127: cannam@127: cannam@127: