934 views

1 Answer

Best answer
1 votes
1 votes

in this question  instruction is :  I1-->I2--->I3-->I4-->I5-->I6-->I12-->I13-->I14--->I15--->I16

and its 5 stage pipeline so K=5 and n=  11

here branch penality =  target address available - 1

 execution time of pipeline =  (K+n-1)* tP + (branch penality)* tp

                                       =  (5+11-1)*10 +(3-1)*10

                                       =  15*10 + 2*10

                                      =  170 ns

  option A is correct

selected by

Related questions

0 votes
0 votes
1 answer
1
kathan Mistry asked Aug 9, 2022
561 views
In a pipelined architecture Static branch prediction is used with branch taken assumption. Assume that 30% of the instructions executed for a program are branch instructi...
0 votes
0 votes
1 answer
3