This section describes the cluster Fast Fourier Transform (FFT) functions implemented in

Intel® oneAPI Math Kernel Library

.

The cluster FFT function library was designed to perform fast Fourier transforms on a cluster, that is, a group of computers interconnected via a network. Each computer (node) in the cluster has its own memory and processor(s). Data interchanges between the nodes are provided by the network.

One or more processes may be running in parallel on each cluster node. To organize communication between different processes, the cluster FFT function library uses the Message Passing Interface (MPI). To avoid dependence on a specific MPI implementation (for example, MPICH, Intel® MPI, and others), the library works with MPI via a message-passing library for linear algebra called BLACS.

Cluster FFT functions of

Intel® oneAPI Math Kernel Library

provide one-dimensional, two-dimensional, and multi-dimensional (up to the order of 7) functions and both Fortran and C interfaces for all transform functions.

To develop applications using the cluster FFT functions, you should have basic skills in MPI programming.

The interfaces for the

Intel® oneAPI Math Kernel Library

cluster FFT functions are similar to the corresponding interfaces for the conventional

Intel® oneAPI Math Kernel Library

FFT functions. Refer there for details not explained in this section.

Table

"Cluster FFT Functions in

Intel® oneAPI Math Kernel Library

"

lists cluster FFT functions implemented in

Intel® oneAPI Math Kernel Library

: