Parsec Sample Programs

This directory contains several simple, illustrative Parsec examples in progress, as well as some MPI versions. Below are links to the sample programs, along with brief descriptions. If you have used Maisie in the past, you will need to update your code for compatability with Parsec. You can compare these with Maisie version 3.0 Sample Programs.

Sequential Programs

• Sieve of Eratosthenes 1: Sequential program which uses the Sieve of Eratosthenes algorithm to generate all prime numbers less than 1000. Provides an example of the new "stacksize" feature.

Parallel Programs

• All Pairs Shortest Path: Parallel program which determines the shortest path between any two points, given a number of points and possible routes. Includes sample input file. MPI version available.

• Cholesky Factorization: Parallel program that determines the factors of a matrix using block striped mapping. Includes sample input file and output file.

• Fast Fourier Transform: Program calculates the FFT of a given N numbers. MPI version only.

• Gauss-Jordan Elimination: Row-oriented parallel program for solving systems of equations. MPI version only.

• Matrix Multiplication: Parallel program which multiplies two matrices. Includes sample input file.

• Matrix Multiplication 2 and 3: Parallel program which multiplies two matrices, based on Cannon's algorithm. Includes sample input file.

• Othello Game: A Parsec implementation of the Othello game.

• Sieve of Eratosthenes 2: Parallel version which uses a parallel Sieve of Eratosthenes algorithm to generate all prime numbers less than 1000.

Parallel Synthetic Programs

• Ping-Pong: A program which passes a message back and forth between two entities. MPI version available.

• Ring Topology: A program which passes a message around a ring of two or more entities. MPI version available.

• Random Topology 1: A program which passes a message among two or more entities in a random order. MPI version available.

• Random Topology 2: A program which passes multiple messages among two or more entities in a random order. MPI version available.

Sequential Simulations

• Producer-Consumer System: Simulation of a producer consumer system.

• Resource Manager: Simulates a physical system consisting of one CPU server, one disk server, and several jobs. Both CPU and disk servers serve the jobs in FIFO order.

Parallel Simulations

• Arpa-Net Simulator: Old arpha-net protocol simulator. Includes header file and input file.

• Closed Queuing Network 0: Simulation of a simple queuing network, where each queue entity models a single server.

• Closed Queuing Network 1: Simulation of a simple queuing network, where each queue entity models a single server.

• Closed Queuing Network 2: Simulation of a simple queuing network, where each queue entity models several servers.