FFT_OPENMP
Fast Fourier Transform Using OpenMP


FFT_OPENMP is a C++ program which demonstrates the computation of a Fast Fourier Transform in parallel, using OpenMP.

Usage:

In the BASH shell, the program could be run with 2 threads using the commands:

        export OMP_NUM_THREADS=2
        ./fft_openmp
      

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

FFT_OPENMP is available in a C version and a C++ version and a FORTRAN90 version.

Related Data and Programs:

DIJKSTRA_OPENMP, a C++ program which uses OpenMP to parallelize a simple example of Dijkstra's minimum distance algorithm for graphs.

FFT_SERIAL, a C++ program which demonstrates the computation of a Fast Fourier Transform, and is intended as a starting point for implementing a parallel version using OpenMP.

HEATED_PLATE_OPENMP, a C++ program which solves the steady (time independent) heat equation in a 2D rectangular region, using OpenMP to run in parallel.

HELLO_OPENMP, a C++ program which prints out "Hello, world!" using the OpenMP parallel programming environment.

JACOBI_OPENMP, a C++ program which illustrates the use of the OpenMP application program interface to parallelize a Jacobi iteration solving A*x=b.

MD_OPENMP, a C++ program which carries out a molecular dynamics simulation using OpenMP.

MULTITASK_OPENMP, a C++ program which demonstrates how to "multitask", that is, to execute several unrelated and distinct tasks simultaneously, using OpenMP for parallel execution.

MXM_OPENMP, a C++ program which computes a dense matrix product C=A*B, using OpenMP for parallel execution.

OPENMP, C++ programs which illustrate the use of the OpenMP application program interface for carrying out parallel computations in a shared memory environment.

OPENMP_RCC, C++ programs which illustrate how a C program, using OpenMP, can be compiled and run in batch mode on the FSU High Performance Computing (HPC) cluster operated by the Research Computing Center (RCC).

POISSON_OPENMP, a C++ program which computes an approximate solution to the Poisson equation in a rectangle, using the Jacobi iteration to solve the linear system, and OpenMP to carry out the Jacobi iteration in parallel.

PRIME_OPENMP, a C++ program which counts the number of primes between 1 and N, using OpenMP for parallel execution.

QUAD_OPENMP, a C++ program which approximates an integral using a quadrature rule, and carries out the computation in parallel using OpenMP.

RANDOM_OPENMP, a C++ program which illustrates how a parallel program using OpenMP can generate multiple distinct streams of random numbers.

SATISFY_OPENMP, a C++ program which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfy problem, using OpenMP for parallel execution.

SCHEDULE_OPENMP, a C++ program which demonstrates the default, static, and dynamic methods of "scheduling" loop iterations in OpenMP to avoid work imbalance.

SFTPACK, a C++ library which implements the "slow" Fourier transform, intended as a teaching tool and comparison with the fast Fourier transform.

SGEFA_OPENMP, a C++ program which solves a linear system by Gaussian elimination, using OpenMP.

ZIGGURAT_OPENMP, a C++ program which demonstrates how the ZIGGURAT library can be used to generate random numbers in an OpenMP parallel program.

Reference:

  1. Wesley Petersen, Peter Arbenz,
    Introduction to Parallel Computing - A practical guide with examples in C,
    Oxford University Press,
    ISBN: 0-19-851576-6,
    LC: QA76.58.P47.
  2. Rohit Chandra, Leonardo Dagum, Dave Kohr, Dror Maydan, Jeff McDonald, Ramesh Menon,
    Parallel Programming in OpenMP,
    Morgan Kaufmann, 2001,
    ISBN: 1-55860-671-8,
    LC: QA76.642.P32.
  3. Barbara Chapman, Gabriele Jost, Ruud vanderPas, David Kuck,
    Using OpenMP: Portable Shared Memory Parallel Processing,
    MIT Press, 2007,
    ISBN13: 978-0262533027,
    LC: QA76.642.C49.

Source Code:

List of Routines:

You can go up one level to the C++ source codes.


Last revised on 20 March 2009.