Introduction to Parallel Computation

RISC-Linz logo

Exercise 2: Data Parallel Programming

Write a "paper and pencil" MPL program for the "All Pairs Shortest Paths" problem on the basis of the accompanying C program.

The program shall work with any number of graph nodes (hint: embed the distance matrix into the next larger matrix whose dimensions are multiples of the corresponding processor array dimensions).

The result of this exercise is a small paper that contains the source of your program, and a description of the algorithmic ideas.

Have fun!

Real programmers don't comment their code. It was hard to write, it should be hard to understand.

Real programmers disdain structured programming. Structured programming is for compulsive neurotics who were prematurely toilet-trained. They wear neckties and carefully line up pencils on otherwise clear desks.

Maintained by: Wolfgang Schreiner
Last Modification: March 7, 1997

[Up] [RISC-Linz] [University] [Search]