This video presents experimental results of the parallel sorting algorithm on a shared-memory computer with 32 processors. I introduce the terms speedup, efficiency, and two types of scalability, weak and strong. The predictive power of the BSP cost model is put to the test by comparing prediction and experiment for the separate supersteps of the sorting algorithm.
This video corresponds to Section 1.10 of the book Parallel Scientific Computation: A Structured Approach Using BSP, Second Edition, by Rob H. Bisseling, Oxford University Press, 2020.
An expanded set of slides, solutions to the homework questions, and software accompanying the book can all be found on my personal book page:
https://webspace.science.uu.nl/~bisse101/Book2/psc2
