Answer Happy

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 nms: (1a) {5 points} 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. Answer: (1b) {10 points} Based on the Gustafson's law, calculate the minimum problem size (n) in order to achieve a speed-up of 10X using 16 processors.