If the program that obtains linear speep up is strongly scalable?
Answers
Answered by
0
Explanation:
Theoretically speedup can never exceed the number of processing elements . If the best sequential algorithm takes units of time to solve a given problem on a single processing element, then a speedup of can be obtained on processing elements if none of them spends more than time T s / p .
Similar questions