Instruction pipelines, Computer Engineering

Assignment Help:

Instruction Pipelines

As discussed previous, the stream of instructions in the instruction implementation cycle, can be realized through a pipeline where overlapped implementation of different operations are performed. The process of implenting the instruction involves the following main steps:

  • Fetch the instruction by the main memory
  • Decode the instruction
  • Fetch the operand
  • Implement the decoded instruction

These four steps become the candidates for phases for the pipeline, which we state as instruction pipeline (It is given in Figure).

                                                471_Instruction Pipelines.png

                                                          Figure: Instruction Pipeline

While, in the pipelined implementation, there is overlapped implementation of operations, the four phases of the instruction pipeline will work in the overlapped manner. Firstly, the instruction address is fetched from the memory to the first phase of the pipeline. The first phase fetches the instruction and provides its output to the second phase. Whereas, the second phase of the pipeline is decoding the instruction, the first phase gets another input and provides the next instruction. When the first instructions have been decoded in the second phase, then its output is fed to the third phase. When the third phase is fetching the operand for the first instruction, then the second phase gets the second instruction and the first phase gets input for another instruction and so on. In this manner, the pipeline is implementing the instruction in an overlapped way increasing the speed of execution and throughput.

The situation of these overlapped operations in the instruction pipeline can be demonstrated through the space-time diagram. In Figure, firstly we show the space-time diagram for non-overlapped implementation in a sequential environment and then for the overlapped pipelined environment. It is clear from the two diagrams that in non-overlapped implementation, results are achieved only after 4 cycles while in overlapped pipelined implementation, after 4 cycles, we are receiving output after every cycle. Soon in the instruction pipeline, the instruction cycle has been deduced to ¼ of the sequential implementation.

                                      879_Space-time diagram for Non-pipelined Processor.png

                                                Space-time diagram for Non-pipelined Processor

                                    967_Space-time diagram for Overlapped Instruction pipelined Processor.png

                                              Space-time diagram for Overlapped Instruction pipelined Processor


Related Discussions:- Instruction pipelines

Find the complement of following functions, Q. Find the complement of follo...

Q. Find the complement of following functions and reduce to minimum literals 1. (A+C+D) (A+C+D') (A+C'+D)(A+D') 2. ABC(ABC' + AB'C + A'BC) 3. AB + AB' + A'C +A'C'

How to calculate the logic circuit outputs, How to Calculate the Logic Circ...

How to Calculate the Logic Circuit Outputs? Once the Boolean expression for a circuit output has been acquired, the output logic level can be determined for any set of input le

Decision support at a digital hospital, Heart disease is the number-one kil...

Heart disease is the number-one killer in the United States, and in a cardiac crisis, each minute matters. Indiana Heart Hospital (IHH) is a new cardiac hospital that saves life b

One pointer variable be subtracted from another, Under what conditions can ...

Under what conditions can one pointer variable be subtracted from another? Pointer subtraction isn't used very much, but can be handy to determine the distances between two arr

Perfect induction, Any identity or equality in Boolean algebra, suchas de M...

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

Basic performance equation, Explain the basic performance equation Ans...

Explain the basic performance equation Ans: The basic performance equation is following T = N * S/ R T =>  It is processor time required to execute a program N => act

State the disadvantages of interviewing, State the Disadvantages of  inter...

State the Disadvantages of  interviewing -  can be expensive to carry out    -  can be a very time consuming exercise -  Unable to remain anonymous

Define parsing, Define Parsing Parsing is the method of analyzing a te...

Define Parsing Parsing is the method of analyzing a text, made up of a sequence of tokens, to define its grammatical structure with respect to a given formal grammar. Parsing

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd