Exercise E10:
- Write a sequential and a parallel mergesort program to sort
2n random numbers (n=10,15,20,25) on P=2d
processors (d=0,..,5).
- For each n measure execution times of the sequential program
and of the parallel program with the specified range of processor numbers.
- Generate graphs as introduced in the lecture with the line of linear
speed-up. What can you conclude about the efficiency of your algorithm for
various n?
- Generate a graph of speed-up versus processor number containing the
line of optimal speed-up.
Back