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

Draw the circuit diagram of a Master-Slave J-K flip-flop, Draw the circuit ...

Draw the circuit diagram of a Master-slave J-K flip-flop using NAND gates. What is race around condition? How is it eliminated in a Master-slave J-K flip-flop? Ans. Using NA

Explain efficiency performance and issues in pipelining, Efficiency The...

Efficiency The effectiveness of pipeline can be measured the same as the ratio of busy time span to total time span counting the idle time. Let c be clock period of a pipeline

Explain use of mpi functions with an example, Q. Explain use of MPI functio...

Q. Explain use of MPI functions with an example? include int main(int argc, char **argv) { int i, tmp, sum, s, r, N, x[100]; MPI_Init(&argc, &argv); MPI_Comm_size

Subtraction of 01100-00011 using 2's complement method, Subtraction of 0110...

Subtraction of 01100-00011 using 2's complement method Ans. Firstly 1's complement of 00011 is 11100 and 2's complement is 11100 + 1 = 11101. Thus If a last carry is

Initial considerations in problem solving, Initial considerations in proble...

Initial considerations in problem solving: Three initial considerations in problem solving for easiest(as described in Russell and Norvig):  Initial State  First

Explain COMS inverter, Explain CMOS Inverter with the help of a neat circui...

Explain CMOS Inverter with the help of a neat circuit diagram. Ans: CMOS Inverter: The fundamental CMOS logic circuit is an inverter demonstrated in Fig.(a). For above

Name the software required to run video conferencing, Name The software req...

Name The software required to run video conferencing The software and hardware required to run video conferencing is very sophisticated. Apart from obvious items (that is large

Which approaches not require knowledge of the system state, Which approache...

Which approaches do not require knowledge of the system state? Ans. Deadlock detection, deadlock prevention and deadlock avoidance; none of the given require knowledge of the s

Design a half adder, Q. Design a half adder? In half adder inputs are: ...

Q. Design a half adder? In half adder inputs are: The augend let's say 'x' and addend 'y' bits. The outputs are sum 'S' and carry 'C' bits. Logical relationship betwee

Define structural classification, Structural Classification Flynn's cla...

Structural Classification Flynn's classification explains the behavioural idea and doesn't take concern into the computer's structure. Parallel computers can be categorized bas

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