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
Give example of bus and memory transfer For example, the read operation for transfer of a memory unit M from address register AR to another data register DR can be illustrated

Q. Explain Cache Organisation? Cache memories are found in nearly all latest computers.  They are very helpful for increasing speed of access of information from memory.  Let's

It is desirable that operating speed of primary storage of a computer system be as fast as possible since most of the data transfer to and from processing unit is via main memory.

Q. Design an OR to AND gates combinational network for the following Boolean expression:   ABCD + A'BC'D + A'BC'D' + A'BCD + (A'B'C'D' + AB'CD) Two terms in parenthesis are Don

Q. What is Arrays Pointers? An array is a collection of similar type of data. Arrays are extremely popular data structures in parallel programming because of their easiness of

Q. Example to show directory in doc? Like a file name, the directory name may also have up to eight alpha-numeric characters. The directory name can also have an extension

graphical adapters and input methods in computer graphics

I need to write a 32 bit adder in MIPS without using the Add command and a divider as well.

Q. Write short notes on proton - proton fusion in sun. Proton - Proton cycle 1 H 1 + 1 H 1 → 1 H 2 + 1 e 0 + ν (emission of positron as well as neutrino) 1

Automated Reasoning - first-order logic: The topic known as "Automated Reasoning" in "AI"concentrates mostly on deductive reasoning, here new facts are logically deduced from