Introduction to Parallel Computation
|
Write on the Convex SPP parallel programs in Fortran or C solving the "All Pairs Shortest Path" problem. Take the sequential program as the starting point and use the MPI library to develop the parallel program in the message passing model.
-O2
. Measure the execution
times for matrix dimensions 256 and 384 and take these times as the
base times of all your comparisons with the parallel programs.
-O2
and and measure the execution times for both input sizes and
1, 2, 4, 8, 16 processors (2i, as many as available).
-O2
and and measure the execution times for both input
sizes and 1, 4, 9, 16 processors (i2, as many as available).
mpa -sc parallel
to move to subcomplex "parallel",
/usr/convex/mpich/bin
in your PATH variable,
mpicc
or mpif77
(-O2
),
mpirun -np n program
to run program with
n processes.
MPI_Wtime
to measure wall clock times (see the man page),
MPI
, mpicc
, mpif77
,
mpirun
, and mpiclean
and for all the MPI library calls.
Various environment variables can be used to customize the execution (see the
man pages).
Deliver your preliminary report by the first deadline shown below; be prepared to present and to discuss it in class. Based on our discussions, overwork your programs and deliver the final report by the second deadline shown below. Both reports will be used for grading.
First Report and Presentation: January 12
Final Report and Presentation: January 26