recategorized by
2,032 views
0 votes
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:

  1. $\frac{1}{1-f-f/P}$
  2. $\frac{P}{P-f(P+1)}$
  3. $\frac{1}{1-f+f/P}$
  4. $\frac{P}{P+f(P-1)}$
recategorized by

1 Answer

Best answer
1 votes
1 votes

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!

selected by
Answer:

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Jul 12, 2016
1,731 views
Which of the following flags are set when ‘JMP’ instruction is executed?SF and CFAF and CFAll flagsNo flag is set
1 votes
1 votes
1 answer
4
go_editor asked Jul 13, 2016
2,961 views
A* algorithm is guaranteed to find an optimal solution ifh’ is always 0g is always 1h’ never overestimates hh’ never underestimates h