Exercises
Grades will be based on two programming exercises accompanying the lecture.
- All Pairs Shortest Paths (
pathf.f
)
(pathc.c
) -
The sequential programs that form the basis of the exercises.
- Exercise 1 (Printing)
-
Automatic parallelization using the Convex SPP compilers.
- Exercise 2
(Printing)
-
Message passing programming using MPI.
Maintained by: Wolfgang Schreiner
Last Modification: December 23, 1997