• retagged by
1,577 views
0 0 votes

Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non­ pipelined but identical CPU, we can say that
(A) T1 <= T2 (B) T1 >= T2

(C) T1 < T2 (D) T1 is T2 plus the time taken for one instruction fetch cycle

The answer given in all sources is B.
The answer should be C acccording to me.As it is told we are comparing the time taken by a  single instruction And because of the buffers in the different stages of the pipelined system would’nt  it take more time than the time a single instruction would take to execute in a non-pipelined system  as it has only one unit.(I AM COMPARING ONLY THE TIME TAKEN BY A SINGLE INSTRUCTION).

1 Answer

3 3 votes
It has been given that the CPU's are identical , with only one difference , one has a pipelined architecture , i.e while some unit e.g the decoding is happening , instruction fetch and PC increment unit can be carried out in the same clock cycle(of course with the use of interstage buffer) , and the other CPU has a non-pipelined architecture , i.e no sharing of clock cycles takes place.

We can safely take into assumption that no interstage buffer is being used in the non-pipelined architecture.

Let's say both the CPU's have 5 stage data path , namely $IF , ID , IE, M , WB$.

Let's say each stage takes $x \ clock \ cycles$.

In case of pipelined processor , let the interstage buffer delay = $y \ clock \ cycles$.

Total clock cycles for execution of an instruction in pipelined architecture(T1) = $5x+4y$ clock cycles.

Total clock cycles for execution of an instruction in non-pipelined architecture(T2) = $5x$.

In this scenario , T1>T2.

Now if non-pipelined architecture too had interstage buffers , then total time would've been = $5x+4y$.

In this scenario , T1= T2.

Thus $T1>=T2$ shall be correct.

Pipelining speeds up in long run , for only one instruction it is as good as non-pipelined version.
Position:
Show:

Related questions

78 78 votes
11 answers 11 answers
33.7k
33.7k views
go_editor asked Sep 28, 2014
33,724 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...
197 197 votes
9 answers 9 answers
78.1k
78.1k views
Kathleen asked Sep 22, 2014
78,073 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
35.6k
35.6k views
Kathleen asked Sep 12, 2014
35,649 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...
111 111 votes
12 answers 12 answers
30.2k
30.2k views
Kathleen asked Sep 14, 2014
30,161 views
An instruction pipeline has five stages where each stage take 2 nanoseconds and all instruction use all five stages. Branch instructions are not overlapped. i.e., the ins...