2.17. A parallel program that obtains a speedup greater than pthe number of pro- cesses or threadsis sometimes said to have superlinear speedup. However, many authors don't count programs that overcome resource limitations" as having superlinear speedup. For example, a program that must use secondary storage for its data when it's run on a single processor system might be able to fit all its data into main memory when run on a large distributed-memory system. Give another example of how a program might overcome a resource limitation and obtain speedups greater than p. 1 of 2 2.19. Suppose Tserial = n and Tparallel = n/p + log2 (p), where times are in microsec- onds. If we increase p by a factor of k, find a formula for how much we'll need to increase n in order to maintain constant efficiency. How much should we increase n by if we double the number of processes from 8 to 16? Is the parallel program scalable? 2.17. A parallel program that obtains a speedup greater than pthe number of pro- cesses or threadsis sometimes said to have superlinear speedup. However, many authors don't count programs that overcome resource limitations" as having superlinear speedup. For example, a program that must use secondary storage for its data when it's run on a single processor system might be able to fit all its data into main memory when run on a large distributed-memory system. Give another example of how a program might overcome a resource limitation and obtain speedups greater than p. 1 of 2 2.19. Suppose Tserial = n and Tparallel = n/p + log2 (p), where times are in microsec- onds. If we increase p by a factor of k, find a formula for how much we'll need to increase n in order to maintain constant efficiency. How much should we increase n by if we double the number of processes from 8 to 16? Is the parallel program scalable