@Shiva,what basis you've used for calculation?

The Gateway to Computer Science Excellence

0 votes

Let $f$ be the fraction of the computation (in terms of time) that is parallelizabl$e$. $P$ the number of processors in the system, and $s_p$ the speed up achievable in comparison with sequential execution – then the $s_p$ can be calculated using the relation:

- $\frac{1}{1-f-f/P}$
- $\frac{P}{P-f(P+1)}$
- $\frac{1}{1-f+f/P}$
- $\frac{P}{P+f(P-1)}$

+1 vote

Best answer

answer **C**

- Let execution time without parallelism is 1.
- If f is the fraction of parallel computation (1-f) time must be spend for sequential computation.
- f fraction of computation can be distributed among P processors; So it will take f/P time to complete computation.
- Total time for computation with parallelism = 1-f + f/P

speed up = time _{without parallelism} / time _{with parallelism}

= 1/ 1-f + f/P

// *Correct me if I am wrong!*

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.6k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,833 questions

57,686 answers

199,280 comments

107,227 users