retagged by
998 views
0 0 votes
Consider a $5$ stage instruction pipeline which can implement the $4$ instructions $I1, \ I2, \ I3, \ I4$. Below table gives the number of clocks required per instruction per stage.

$\begin{array}{|c|c|c|c|c|c|} \hline {} & S1 & S2 & S3 & S4 & S5 \\ \hline I1 & 3 & 1 & 2 & 1 & 2 \\ \hline I2 & 1 & 3 & 1 & 3 & 2 \\ \hline I3 & 1 & 1& 1 & 1 & 2 \\ \hline I4 & 2 & 1 & 2 & 1 &1 \\ \hline \end{array}$

The speed up of the pipeline is approximately  ________

2 Answers

Best answer
0 0 votes
  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
I1 S1 S1 S1 S2 S3 S3 S4 S5 S5              
I2       S1 S2 S2 S2 S3 S4 S4 S4 S5 S5      
I3         S1 --- --- S2 S3 --- --- S4 --- S5 S5  
I4           S1 S1 -- S2 S3 S3 --- S4 --- --- S5

Speed up of pipeline = time without pipeline / time with pipeline 

= 32/16

= 2.0

selected by
0 0 votes
I THINK ANSWER IS 1.88235
Answer:
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
1.7k
1.7k views
Bikram asked May 27, 2017
1,696 views
Consider a pipelined system with these $4$ phases:FI – Fetch instructionDA – Decode and calculate addressFO – Fetch OperandEX- Execute instructionEach phase requires on...
0 0 votes
1 answers 1 answer
596
596 views
Bikram asked May 27, 2017
596 views
Which of the following statements is/are correct about hazards?One way to implement branch prediction is to store the result of a branch condition in a branch target buff...
3 3 votes
2 answers 2 answers
1.5k
1.5k views
Bikram asked May 27, 2017
1,524 views
Suppose there are $m$ instructions to be executed in a program. $p$ is the probability that an instruction is a conditional branch instruction, and $q$ is the probabilit...
1 1 vote
1 1 answer
594
594 views
Bikram asked May 27, 2017
594 views
Consider the following two types of Cache Designs : Cache $1$: It is a direct-mapped cache with eight $1$ – word cache lines. The miss penalty is $8$ clock cycles.Cache $...