DIJKSTRA_OPENMP
Dijkstra Graph Distance Algorith using OpenMP


DIJKSTRA_OPENMP is a FORTRAN90 program which illustrates the use of the OpenMP application program interface by implementing Dijkstra's minimum graph distance algorithm.

The program is an interesting example, because it does not involve parallelization of a loop. Instead, a parallel region is defined, and the nodes of the graph are divided up among the threads. The resulting parallel algorithm naturally requires some of the more advanced OpenMP directives, including critical, single and barrier, in order to work correctly.

The actual graph that is analyzed is very small (6 nodes), but of course the same algorithm would work for larger graphs. The point is rather to see how the OpenMP directives can be put together correctly.

Licensing:

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

Languages:

DIJKSTRA_OPENMP is available in a C version and a C++ version and a FORTRAN77 version and a FORTRAN90 version.

Related Data and Programs:

DIJKSTRA, a FORTRAN90 program which runs a simple example of Dijkstra's minimum distance algorithm for graphs.

DIJKSTRA_SPMD, a MATLAB program which uses the SPMD feature to parallelize a simple example of Dijkstra's minimum distance algorithm for graphs.

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

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

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

MANDELBROT_OPENMP, a FORTRAN90 program which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set, using OpenMP for parallel execution.

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

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

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

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

OPENMP_RCC, FORTRAN90 programs which illustrate how a FORTRAN90 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 FORTRAN90 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 FORTRAN90 program which counts the number of primes between 1 and N, using OpenMP for parallel execution.

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

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

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

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

SGEFA_OPENMP, a FORTRAN90 program which reimplements the SGEFA/SGESL linear algebra routines from LINPACK for use with OpenMP.

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

Reference:

  1. Peter Arbenz, Wesley Petersen,
    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.
  4. The OpenMP web site
  5. OpenMP Architecture Review Board,
    OpenMP Application Program Interface,
    Version 3.0,
    May 2008.

Source code:

Examples and Tests:

DIJKSTRA_LOCAL_GFORTRAN compiles, links, loads and runs the program using 1, 2 and 4 threads, the local interactive environment, and the GNU GFORTRAN compiler.

DIJKSTRA_LOCAL_IFORT compiles, links, loads and runs the program using 1, 2 and 4 threads, the local interactive environment, and the Intel IFORT compiler.

DIJKSTRA_ITHACA_GFORTRAN compiles, links, loads and runs the program using 1, 2 and 4 threads, using the PBS queueing system on Virginia Tech's Ithaca cluster, and the GNU GFORTRAN compiler.

DIJKSTRA_ITHACA_IFORT compiles, links, loads and runs the program using 1, 2 and 4 threads, using the PBS queueing system on Virginia Tech's Ithaca cluster, and the Intel IFORT compiler.

You can go up one level to the FORTRAN90 source codes.


Last revised on 02 July 2010.