This directory contains several simple, illustrative Maisie 3.0 (not released) examples, as well as some MPI versions. Below are links to the sample programs, along with brief descriptions. If you have used Maisie v. 2 in the past, you will need to update your code for compatability with Maisie version 3.0.

Note: Because the IBM SP2 uses gcc C compiler, several warning messages may be generated during compilation. Do not be overly concerned if this occurs; the executable should still be intact.

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 parallel implementation of the Othello game.

• 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.

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

Simulations

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

• 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.

• Dining Philosophers: A parallel simulation of the classic dining philosophers problem.

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

• Resource Manager 1: 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.

• Resource Manager 2: Simulates the behavior of a resource manager that controls two types of resources: printers and channels. Printer jobs are served shortest job first. Also demonstrates the use of compound_resume statement and function association.

• Tandem Queue Simulation: Simulation of a tandem queue which also illustrates use of Maisie trac