mandelbrot_openmp, a FORTRAN90 code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot set, using OpenMP for parallel execution.
The Mandelbrot set is a set of points C in the complex plane with the property that the iteration
z(n+1) = z(n)^2 + cremains bounded.
All the points in the Mandelbrot set are known to lie within the circle of radius 2 and center at the origin.
To make a plot of the Mandelbrot set, one starts with a given point C and carries out the iteration for a fixed number of steps. If the iterates never exceed 2 in magnitude, the point C is taken to be a member of the Mandelbrot set.
Creating an image of the Mandelbrot set requires determining the behavior of many points C under the Mandelbrot mapping. But each point can be studied independently of the others, which makes this calculation suitable for a parallel implementation.
The computer code and data files described and made available on this web page are distributed under the MIT license
mandelbrot_openmp is available in a C version and a C++ version and a FORTRAN90 version.
DIJKSTRA_OPENMP, a FORTRAN90 code which uses OpenMP to parallelize a simple example of Dijkstra's minimum distance algorithm for graphs.
FFT_OPENMP, a FORTRAN90 code which demonstrates the computation of a Fast Fourier Transform in parallel, using OpenMP.
HEATED_PLATE_OPENMP, a FORTRAN90 code which solves the steady (time independent) heat equation in a 2D rectangular region, using OpenMP to run in parallel.
HELLO_OPENMP, a FORTRAN90 code which prints out "Hello, world!" using the OpenMP parallel programming environment.
JACOBI_OPENMP, a FORTRAN90 code which illustrates the use of the OpenMP application program interface to parallelize a Jacobi iteration solving A*x=b.
MANDELBROT, a FORTRAN90 code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set;
MD_OPENMP, a FORTRAN90 code which carries out a molecular dynamics simulation in parallel, using OpenMP.
MULTITASK_OPENMP, a FORTRAN90 code which demonstrates how to "multitask", that is, to execute several unrelated and distinct tasks simultaneously, using OpenMP for parallel execution.
MXM_OPENMP, a FORTRAN90 code which computes a dense matrix product C=A*B, using OpenMP for parallel execution.
openmp_test, FORTRAN90 codes which use the OpenMP application code interface for carrying out parallel computations in a shared memory environment.
POISSON_OPENMP, a FORTRAN90 code 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.
PPMA_IO, a FORTRAN90 code which handles the ASCII Portable Pixel Map (PPM) format.
PRIME_OPENMP, a FORTRAN90 code which counts the number of primes between 1 and N, using OpenMP for parallel execution.
QUAD_OPENMP, a FORTRAN90 code which approximates an integral using a quadrature rule, and carries out the computation in parallel using OpenMP.
RANDOM_OPENMP, a FORTRAN90 code which illustrates how a parallel program using OpenMP can generate multiple distinct streams of random numbers.
SATISFY_OPENMP, a FORTRAN90 code 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 code which demonstrates the default, static, and dynamic methods of "scheduling" loop iterations in OpenMP to avoid work imbalance.
ZIGGURAT_OPENMP, a FORTRAN90 code which demonstrates how the ZIGGURAT library can be used to generate random numbers in an OpenMP parallel program.