Instruction pipelines, Computer Engineering

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

Posted Date: 3/2/2013 7:06:09 AM | Location : United States







Related Discussions:- Instruction pipelines, Assignment Help, Ask Question on Instruction pipelines, Get Answer, Expert's Help, Instruction pipelines Discussions

Write discussion on Instruction pipelines
Your posts are moderated
Related Questions
How is a property designated as read-only?  In VB.NET: Public Read-Only Property Property Name As Return Type Get? Your Property execution goes in here End Get End Property.

Representations/Languages Used: Many people are taught "AI" with the opening line: "The three most important things in "AI" are  representation, representation and representat

Explain the term - ancestors The ancestors of modern age computer were mechanical and electro-mechanical instruments. This ancestry can be traced as back and seventeenth centur

Q. Evaluation Stack Architecture? A stack is a data structure which implements Last-In-First-Out (LIFO) access policy. You can add an entry to the with a PUSH(value) as well as


Problem 1 Prove that :- x(x + y) = x by using identities 2 Write a short note on Analog to Digital Converter (ADC) 3 Differentiate between sequential and combinational ci

What are Addressing Modes Many of instructions that a computer actually executes during running of a program concern movement of data to and from memory. It is not possible sim

Minimise the logic function F (A, B, C, D) = Π M (1, 2, 3, 8, 9, 10, 11,14) ⋅ d (7, 15) Use Karnaugh map.   Ans. Given function F=∏M(1,2,3,8,9,10,11,14).d(7, 15) F'=B'D+B'C+AC+AB'

What are the disadvantages of Bespoke Software -  Very dependent on suppliers of the software; if they go out of business there would be little or no support if problems occ

Compare memory mapped I/O with I/O mapped I/O. Memory Mapped I/O Scheme: In this scheme there is only one address space. Address space is stated as all possible addresses tha