00:01
First one is simple question number a.
00:03
This is saying that what is the maximum fraction of execution time that can be spent performing inherently sequential operations if a parallel application is to achieve a speedup of 50 over its sequential counterpart.
00:18
So where we have to find the simply speedup.
00:21
So we know the formula for the speedup is what? formula for speedup is simply what? limit p tending to infinity.
00:32
It is simply a probability formula and 1 by we can say 50 percent, 50 percent and 1 minus again it is equal to 50 percent by p.
00:45
So now here just solving again this formula limit p tending to infinite 1 by 0 .5 plus 1 minus 0 .5 by p and here we are applying the p tending to infinite.
01:02
So here we just apply the p equal to infinite.
01:06
So this term will become equal to what? 0.
01:09
So what we will get the speedup equal to 1 by 0 .5.
01:13
It is equal to simply we can say 2.
01:15
So here answer is 2 for the speedup.
01:17
This is the question number 1 for this question and now we are moving on the question number 2.
01:23
Question number 2 is saying that a parallel program executes in 242 seconds on 16 processors...