For anyone confused about the speedup equation, here is a quick summary.
The original execution time was 2 * n ^ 2.
The new execution time is (n ^ 2) / p + n ^ 2, as the first half has been split over p processors.
To make the equation seem more intuitive, observe behavior as p approaches either 1 or infinity. If p = 1, there is no parallelism. The speedup simplifies to be 1x. If p = infinity, then the speedup simplifies to 2x. This is because half of our program is still sequential.
For anyone confused about the speedup equation, here is a quick summary.
The original execution time was
2 * n ^ 2.The new execution time is
(n ^ 2) / p + n ^ 2, as the first half has been split over p processors.To make the equation seem more intuitive, observe behavior as
papproaches either 1 or infinity. Ifp = 1, there is no parallelism. The speedup simplifies to be 1x. If p = infinity, then the speedup simplifies to 2x. This is because half of our program is still sequential.This comment was marked helpful 2 times.