Chris@19: Next: MPI Data Distribution, Chris@19: Previous: Linking and Initializing MPI FFTW, Chris@19: Up: Distributed-memory FFTW with MPI Chris@19:
Before we document the FFTW MPI interface in detail, we begin with a
Chris@19: simple example outlining how one would perform a two-dimensional
Chris@19: N0 by N1 complex DFT.
Chris@19:
Chris@19:
#include <fftw3-mpi.h>
Chris@19:
Chris@19: int main(int argc, char **argv)
Chris@19: {
Chris@19: const ptrdiff_t N0 = ..., N1 = ...;
Chris@19: fftw_plan plan;
Chris@19: fftw_complex *data;
Chris@19: ptrdiff_t alloc_local, local_n0, local_0_start, i, j;
Chris@19:
Chris@19: MPI_Init(&argc, &argv);
Chris@19: fftw_mpi_init();
Chris@19:
Chris@19: /* get local data size and allocate */
Chris@19: alloc_local = fftw_mpi_local_size_2d(N0, N1, MPI_COMM_WORLD,
Chris@19: &local_n0, &local_0_start);
Chris@19: data = fftw_alloc_complex(alloc_local);
Chris@19:
Chris@19: /* create plan for in-place forward DFT */
Chris@19: plan = fftw_mpi_plan_dft_2d(N0, N1, data, data, MPI_COMM_WORLD,
Chris@19: FFTW_FORWARD, FFTW_ESTIMATE);
Chris@19:
Chris@19: /* initialize data to some function my_function(x,y) */
Chris@19: for (i = 0; i < local_n0; ++i) for (j = 0; j < N1; ++j)
Chris@19: data[i*N1 + j] = my_function(local_0_start + i, j);
Chris@19:
Chris@19: /* compute transforms, in-place, as many times as desired */
Chris@19: fftw_execute(plan);
Chris@19:
Chris@19: fftw_destroy_plan(plan);
Chris@19:
Chris@19: MPI_Finalize();
Chris@19: }
Chris@19:
Chris@19: As can be seen above, the MPI interface follows the same basic style Chris@19: of allocate/plan/execute/destroy as the serial FFTW routines. All of Chris@19: the MPI-specific routines are prefixed with ‘fftw_mpi_’ instead Chris@19: of ‘fftw_’. There are a few important differences, however: Chris@19: Chris@19:
First, we must call fftw_mpi_init() after calling
Chris@19: MPI_Init (required in all MPI programs) and before calling any
Chris@19: other ‘fftw_mpi_’ routine.
Chris@19:
Chris@19:
Chris@19:
Second, when we create the plan with fftw_mpi_plan_dft_2d,
Chris@19: analogous to fftw_plan_dft_2d, we pass an additional argument:
Chris@19: the communicator, indicating which processes will participate in the
Chris@19: transform (here MPI_COMM_WORLD, indicating all processes).
Chris@19: Whenever you create, execute, or destroy a plan for an MPI transform,
Chris@19: you must call the corresponding FFTW routine on all processes
Chris@19: in the communicator for that transform. (That is, these are
Chris@19: collective calls.) Note that the plan for the MPI transform
Chris@19: uses the standard fftw_execute and fftw_destroy routines
Chris@19: (on the other hand, there are MPI-specific new-array execute functions
Chris@19: documented below).
Chris@19:
Chris@19:
Chris@19:
Third, all of the FFTW MPI routines take ptrdiff_t arguments
Chris@19: instead of int as for the serial FFTW. ptrdiff_t is a
Chris@19: standard C integer type which is (at least) 32 bits wide on a 32-bit
Chris@19: machine and 64 bits wide on a 64-bit machine. This is to make it easy
Chris@19: to specify very large parallel transforms on a 64-bit machine. (You
Chris@19: can specify 64-bit transform sizes in the serial FFTW, too, but only
Chris@19: by using the ‘guru64’ planner interface. See 64-bit Guru Interface.)
Chris@19:
Chris@19:
Chris@19:
Fourth, and most importantly, you don't allocate the entire
Chris@19: two-dimensional array on each process. Instead, you call
Chris@19: fftw_mpi_local_size_2d to find out what portion of the
Chris@19: array resides on each processor, and how much space to allocate.
Chris@19: Here, the portion of the array on each process is a local_n0 by
Chris@19: N1 slice of the total array, starting at index
Chris@19: local_0_start. The total number of fftw_complex numbers
Chris@19: to allocate is given by the alloc_local return value, which
Chris@19: may be greater than local_n0 * N1 (in case some
Chris@19: intermediate calculations require additional storage). The data
Chris@19: distribution in FFTW's MPI interface is described in more detail by
Chris@19: the next section.
Chris@19:
Chris@19:
Chris@19:
Given the portion of the array that resides on the local process, it
Chris@19: is straightforward to initialize the data (here to a function
Chris@19: myfunction) and otherwise manipulate it. Of course, at the end
Chris@19: of the program you may want to output the data somehow, but
Chris@19: synchronizing this output is up to you and is beyond the scope of this
Chris@19: manual. (One good way to output a large multi-dimensional distributed
Chris@19: array in MPI to a portable binary file is to use the free HDF5
Chris@19: library; see the HDF home page.)
Chris@19:
Chris@19:
Chris@19:
Chris@19:
Chris@19: