+3 votes
in Computer Architecture by

1 Answer

+1 vote
by
 
Best answer

Here's why a two-stage instruction pipeline is unlikely to cut the instruction cycle time in half, compared with the use of no pipeline;

  1. The execution time will generally be longer than the fetch time. Execution will involve reading and storing operands and the performance of some operation. Thus, the fetch stage may have to wait for some time before it can empty its buffer.
  2. A conditional branch instruction makes the address of the next instruction to be fetched unknown. Thus, the fetch stage must wait until it receives the next instruction address from the execute stage. The execute stage may then have to wait while the next instruction is fetched.

Related questions

Welcome to CPEN Talk
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

With Chuck Norris P = NP. There's no nondeterminism with Chuck Norris decisions.
...