• retagged by
855 views
1 1 vote

Consider the 4-stages(S1, S2, S3, S4) pipeline where different instructions are spending different cycles at different stages given below.

S1S2S3S4
I11312
I21131
I32112
I41112

(a) How many cycles are required to complete the instructions?

(b) Following loop is executed in the pipeline 

for(i = 1; i <= n; i++)

{

   I1;

   I2;

   I3;

   I4;

}

The output of the instruction "I2" will be available after _____ cycles for I2.
  

1 Answer

Position:
Show:

Related questions

80 80 votes
11 answers 11 answers
34.1k
34.1k views
go_editor asked Sep 28, 2014
34,134 views
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
200 200 votes
9 answers 9 answers
79.4k
79.4k views
Kathleen asked Sep 22, 2014
79,398 views
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ALU op...
74 74 votes
4 answers 4 answers
36.1k
36.1k views
Kathleen asked Sep 12, 2014
36,102 views
Which of the following are NOT true in a pipelined processor?Bypassing can handle all RAW hazardsRegister renaming can eliminate all register carried WAR hazardsControl h...
1 1 vote
2 answers 2 answers
832
832 views
tvkkk asked Aug 27, 2016
832 views
In an instruction pipeline of 10 ns clock, the memory instruction takes 2 stalls while branch related instruction takes 3 stalls. If the frequency of memory related and b...