Performance of pipelines with stalls, Computer Engineering

Performance of Pipelines with Stalls:

A stall is reason of the pipeline performance to degrade the ideal performance.

                                            Average instruction time un pipelined

Speedup from pipelining   =   ----------------------------------------

                                             Average instruction time pipelined

 

                                                    CPI un pipelined * Clock Cycle Time unpipelined

                                                = -------------------------------------

                                                     CPI pipelined * Clock Cycle Time pipelined

The ideal CPI on a pipelined machine is approximately always 1. Therefore, the pipelined CPI is CP I pipelined = Ideal CPI + Pipeline stall clock cycles per instruction

                            = 1 + Pipeline stall clock cycles per instruction

If we avoid the cycle time overhead of pipelining and suppose the stages are all perfectly balanced, then the cycle time of the 2 machines are equal and

 

                  CPI un pipelined

Speedup = ----------------------------

                  1+ Pipeline stall cycles per instruction

 

If all of the instructions take the similar number of cycles, which ought to be equal the number of pipeline stages (the depth of the pipeline) then un pipelined CPI is equivalent to the depth of the pipeline, leading to

 

                   Pipeline depth

Speedup = --------------------------

                  1 + Pipeline stall cycles per instruction

 

If there are no pipeline stalls, it leads to the intuitive result that pipelining can developed performance by the depth of pipeline.

 

Posted Date: 10/13/2012 4:33:31 AM | Location : United States







Related Discussions:- Performance of pipelines with stalls, Assignment Help, Ask Question on Performance of pipelines with stalls, Get Answer, Expert's Help, Performance of pipelines with stalls Discussions

Write discussion on Performance of pipelines with stalls
Your posts are moderated
Related Questions
Q. Explain about data registers? The data registers are used just for storing intermediate results or data and not for operand address calculation. Some dedicated address re

Instruction Level It refers to condition where different instructions of a program are implemented by different processing elements. Most processors have various execution unit

Neural networks as perceptrons: However ANNs look like this in the general case:  Considered that the w, x, y and z represent real valued weights so all the edges in t

Why a function canot have delays? However in Open Vera, delays are allowed in function. A function returns a value and hence can be used as a part of any expression. This doesn

The following is taken from the first edition of the Set Book. We have included this because we find these characteristics helpful. We will refer to them later. In addition to t

State the Relative addressing The location of data is specified relative to current value of the program counter. This is helpful for specifying location of data which is given

what is meant by scan conversion?

What are the functions of passes used in two-pass assembler? In an assembly language program, two pass translations can handle forward references early. The subsequent task

What is virtual address? The binary address that the processor used for either instruction or data known as virtual address.

What is a compiler? A Compiler is a program that accepts a program written in a high level language and creates an object program.