Introduction to Parallel Computation
Write on the Convex SPP parallel programs in Fortran and C solving the "All Pairs Shortest Path" problem. Use the enclosed sequential programs as the starting point and apply the parallelization features of the Convex SPP Fortran and C compilers1.
-O2. Measure the execution times for matrix dimensions 256 and 512 and take these times as the base times of all your comparisons with the parallel programs.
-O3without changes and measure the execution times for both input sizes and 1, 2, 4, 8, 16 processors. Analyze the messages generated by the compiler (
-or all) and explain them in detail. Use the CXpa performance profiler (
-pa) to analyze the performance of your program using
-O3without explicit pragmas or parallelization constructs. Proceed in the analysis as for the previous case.
-O3. Proceed in the analysis as for the previous case.
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: November 24
Final Report and Presentation: December 9