Clarification oblig2 concerning exactly what cases to do

1. The three variant that you must implement for A x B are:

1.  A x B using the classic method
2.  A x Transpose(B)
3. Transpose(A) x B

2. For each variant, show the results in table form and in a graph. Each graph should show speedup of the PARALLEL version  relative to SEQUENTIAL version of the algorithm.

3. Furthermore, show a graph with execution times for all six. Show the performance difference between the fastest of the six and the five others. If which is fastest varies depending on the matrix size then use the one that is fastest for the larger arrays.

Have fun :-)

Eric