Pipeline processing-parallel computer architecture , Computer Engineering

Assignment Help:

Pipeline Processing

Pipelining is a process to realize, overlapped parallelism in the proposed answer of a problem, on a digital computer in an economical way. To understand the concept of pipelining, we need to understand first the concept of assembly lines in an automated production plant where items are assembled from separate parts (stages) and output of one stage becomes the input to different stage. Taking the analogy of assembly lines, pipelining is the method to introduce temporal parallelism in computer operations. Assembly line is the pipeline and the separate parts of the assembly line are different stages through which operands of an operation are passed.

To introduce pipelining in a processor P, the following steps given below:

  • Sub-divide the input process into a sequence of subtasks. These subtasks will make phases of pipeline, which are also called as segments.
  • Each phase Si of the pipeline according to the subtask will execute some operation on a distinct set of operands.
  • When phase Si has completed its operation, results are gone to the next stage Si+1 for the next operation.
  • The phase Si takes a new set of input from earlier stage Si-1.

In this way, parallelism in a pipelined processor can be achieved like that m independent operation can be present simultaneously in m segments as shown given below:-

                                                       945_Pipeline Processing.png

The phases or section are executed as pure combinational circuits performing logic or arithmetic operations over the data streams flowing through the pipe. Latches are used to divide the phases, which are quick registers to hold intermediate results among the phases as shown in Figure. Each phase Si consists of a processing circuit Ci and a latch Li .  The last output is stored in output register R. The flow of data vary from one stage to another is controlled by a common clock. Therefore, in every clock period, one stage transmits results to another stage.

                                                  438_Pipeline Processing 1.png


Related Discussions:- Pipeline processing-parallel computer architecture

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

Software project planning, Software Project Planning In the previous da...

Software Project Planning In the previous days of computing software costs comprised a small % of overall computer based system cost. In order of magnitude error software cost

Add the equation by using 648 and 487 in bcd code, Add 648 and 487 in BCD c...

Add 648 and 487 in BCD code. Ans. In BCD Code, addition of 648 and 487: 6 4 8  =  0 1 1 0   0 1 0 0      1 0 0 0 4 8 7  =  0 1 0 0   1 0 0 0      0 1 1 1 ---------------------

Temporary location, Compare zero-, one, two-, and three- address machines b...

Compare zero-, one, two-, and three- address machines by writing programs to compute                         X = (A + B x C)/(D - E x F) for every of the four machines.  Do n

Options with dir in dos, Q. Options with DIR in DOS? You can use a numb...

Q. Options with DIR in DOS? You can use a number of options with DIR. To get the list of files from any other drive, denote the drive name followed by ':' with DIR. For exam

Recordable cds and dvds, Optical disk becomes an attractive alternative for...

Optical disk becomes an attractive alternative for backing up information from hard disk drives and employs large text, audio and video data. Advent of CD-ROM-R and DVD-ROM-R has b

In which page replacement policies balady’s anomaly occurs, In which page r...

In which page replacement policies Balady’s anomaly occurs? FIFO that is First in First Out.

Uniform path cost search - artificial intelligence, Uniform Path Cost Searc...

Uniform Path Cost Search - artificial intelligence: A breadth first search will find the solution with the shortest path length from the initial state to the goal state. In fa

Discuss briefly subscriber loop system, Discuss briefly subscriber loop sys...

Discuss briefly subscriber loop system. Subscriber Loop System: Every subscriber in a telephone network is connected usually to the nearest switching office using a dedicated

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