Note: The example programs in the parallel nofib suite are
rather old, and many not updated to work with GUM 4.xx or GUM 5.xx.
To find test programs for these more recent implementations of GpH
download the following bundle:
example programs for GUM 4.06 onwards.
Makefile.boot for basic documentation and build a program
This repository of programs for Glasgow Parallel Haskell has been inspired by the nofib benchmark suite for the Glasgow Haskell Compiler. But a note of warning: the programs herein are not state-of-the-art benchmarks, and may not even be parallelised to give the best performance. The purpose of this code repository is to provide a suite of programs to be used for experimentation into parallelism. Many of the algorithms have been transcribed from other programming language suites.
A nofib suite subdivides programs into the following categories:
- The nofib Benchmark Suite of Haskell Programs
- Will Partain, In Functional Programming, Glasgow 1992, J Launchbury and PM Sansom, eds., Workshops in Computing, Springer Verlag, 195-202.
You can either download the individual programs or you can download everything:
- Parallel factorial.
- Parallel nfib.
- Parallel quicksort.
- A parallel version of Eratosthenes algorithm for finding prime numbers.
- Parallel sum of squares.
- Finds the next move in the game tic-tac-toe.
- An algorithm for the N-body problem.
- A simple edge detector.
- Computational fluid dynamics calculations.
- A fast Fourier transformation algorithm.
- Parallel RSA encryption algorithm.
- An algorithm for finding a convex hull.
- A simple ray tracer for polygons.
- Searches for words in a grid of letters.
- Runciman and Wakeling (version 6).
- Strategies version.
- A simple ray tracer for spheres.
- A data-parallel digital circuit simulator.
|Other parallel code repositories|
Page last modified: 1999/02/25