0 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)}$ CO & Architecture ugcnetcse-dec2012-paper3 co-and-architecture speedup + – go_editor 2.6k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 1 1 vote 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! sh!va answered Jul 13, 2016 • selected Jun 27, 2017 by Debasmita Bhoumik sh!va comment Share Follow See 1 comment 1 1 comment reply Devshree Dubey commented Oct 31, 2017 reply Follow flag @Shiva,what basis you've used for calculation? 0 0 replyShare Please log in or register to add a comment.
