Question 1: Suppose you have implemented a parallel version of a serial program with the following scaling properties: -

[answerhappygod]

Question 1:
Suppose you have implemented a parallel version of a serial program
with the following scaling
properties:
- The inherently sequential part of the program has a runtime of
(2*n + 4000) ms, where
n is the problem size.
- The parallelizable part of the program has a runtime of n2
ms.
a) Based on the Amdahl's law, calculate the maximum speedup
achievable by this
program on a problem of size n = 1,000, no matter how many
processors are used.
b) Based on the Gustafson's law, calculate the minimum
problem size (n) in order
to achieve a speed-up of 10X using 16 processors.