Maisie Sample Programs

This directory contains several simple, illustrative Maisie examples, as well as some MPI versions. Below are links to the sample programs, along with brief descriptions of the programs and their file names in this directory. Note: some programs may need to be adapted for your specific compiler version; most are for version 2.2. For more information about updating Maisie code for compatability with version 3.0, see our Code Changes for New Maisie Compiler page.

Parallel Programs

• All Pairs Shortest Path (allpairs.m): Parallel program which determines the shortest path between any two points, given a number of points and possible routes.

• Cholesky Factorization (cholsky.may): Parallel program that determines the factors of a matrix using block striped mapping.

• 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 (matrixmult.m): Parallel program which multiplies two matrices.

• Othello Game (othello.m): A parallel implementation of the Othello game.

• Sieve of Eratosthenes 1 (sieve.m): Sequential program which uses the Sieve of Eratosthenes algorithm to generate all prime numbers less than 1000.

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

Simulations

• Arpa-Net Simulator (alpha.m): Old arpha-net protocol simulator. Includes input file (alpha.input).

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

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

• Producer-Consumer System (bounded.m): Simulation of a producer consumer system.

• Resource Manager 1 (resource1.m): 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 (resource2.m): 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 (tandem.m): Simulation of a tandem queue which also illustrates use of Maisie trace facility.

Synthetic Programs

• Ping-Pong (testing/pingMC.m): A program which passes a message back and forth between two entities. MPI version available.

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

• Random Topology 1 (testing/rand-top1.m): A program which passes a message among two or more entities in a random order. MPI version available.

• Random Topology 2 (testing/rand-top2.m): A program which passes multiple messages among two or more entities in a random order. MPI version available.