Performance of pipelines with stalls, Computer Engineering

Assignment Help:

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.

 


Related Discussions:- Performance of pipelines with stalls

Multiprogramming or multitasking, Multiprogramming or multitasking? An...

Multiprogramming or multitasking? Ans: The OS manages the concurrent execution of many application programs to make best possible use of computer resources. This pattern of si

Presumably for heightened tension - first-order logic, Presumably for heigh...

Presumably for heightened tension - first-order logic: As an aside, it's worth pointing out that - presumably for heightened tension - in most Sherlock Holmes books, the m

Characteristics of large register file, Characteristics of large-register-f...

Characteristics of large-register-file and cache organizations Large Register File Cache Hold local variables for almost all functio

Algebra, Discrete Mathematics - (A?B)-(AnB)=(A-B)?(B-A) - prove by cases?? ...

Discrete Mathematics - (A?B)-(AnB)=(A-B)?(B-A) - prove by cases?? State which law you have used at each step. I''ve just started learning this, this semester .. and i havnt quite

Explain deadlock detection algorithm for single instance, Explain deadlock ...

Explain deadlock detection algorithm for single instance of each resource type. For single instance of each resource type the deadlock detection algorithm: (i) Maintain a wa

Define dma, Define DMA. The transfer of data among a fast storage devic...

Define DMA. The transfer of data among a fast storage device such as magnetic disk and memory if often limited by the speed of the CPU. Removing the CPU from the path and letti

Draw and illustrate the block diagram of DMA controller, Draw and illustrat...

Draw and illustrate the block diagram of DMA controller. Also discuss the various modes in which DMAC works. Direct memory access (DMA) is a process in that an external device

Need of the assembly language, Q. Need of the assembly language ? Machi...

Q. Need of the assembly language ? Machine language code comprises the 0-1 combinations which computer decodes directly.  Though the machine language has the following problems

Bus arbitration - computer architecture, Bus arbitration: In single bu...

Bus arbitration: In single bus architecture when more than 1 device requests the bus, a controller known as bus arbiter decides who gets the bus; this is known as the bus arbi

Problem based on banker''s algorithm, A system contains 10 units of resourc...

A system contains 10 units of resource class Ru. The resource requirements of three user processes P1, P2 and P3 are as follows

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