Performance and issues in pipelining-speedup, Computer Engineering

Performance and Issues in Pipelining

Speedup:  Firstly, we get the speedup factor that is we see how much speed up performance we get through pipelining.

First we get the ideal case for measuring the speedup.

Let n be the total number of tasks implemented through m phases of pipelines. Then m phases can process n tasks in clock cycles = m + (n-1)

Time taken to implement without pipelining = m.n

                                                  Speedup due to pipelining = m.n/[m +(n-1)].

As n>=∞ , There is speedup of n times over the non-pipelined implementation.

 

Posted Date: 3/4/2013 4:22:47 AM | Location : United States







Related Discussions:- Performance and issues in pipelining-speedup, Assignment Help, Ask Question on Performance and issues in pipelining-speedup, Get Answer, Expert's Help, Performance and issues in pipelining-speedup Discussions

Write discussion on Performance and issues in pipelining-speedup
Your posts are moderated
Related Questions
Q. Library of functions of parallel virtual machine? PVM offers a library of functions libpvm3.a, that application programmer calls. Every function has some specific effect in

Open addressing:  The easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty location. The idea is to place the

You can select and move a layout table to other areas in a particular document. You can't, though, move a layout table so that it overlaps another. Next you will move the table

What is a matchcode? A match code is an aid to finding records keeps in the system whenever an object key is needed in an input field but the user only knows other (non-key) in

Define the terms : spatial locality and temporal locality. Spatial Locality:  The spatial aspect means that instructions in close proximity to a recently implemented instruct

What is major difference between the Historic Unix and the new BSD release of Unix System V in terms of Memory Management? Historic Unix uses Swapping - Whole process is tran

Design goals: The correct form of a computer system depends on the constraints and aim for which it was optimized. Computer architectures frequently trade off   cost, standard

Q. Concurrently read exclusively write? It's one of the models based on PRAM. In this model, processors access the memory location simultaneously for reading whereas exclusivel

Storing a word in Memory: That is similar process with fetching a word from memory. The required address is loaded into the MAR After that data to be written are lo

COGNITIONS Mr. X exhibits a generally high-quality level of cognitive and intellectual functioning, as evidenced by his performance on the MMSE-2 and WAIS-IV. His one weakness w