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
Accessing a Cache:  Direct mapping: (Block address) modulo (Number of cache block in the cache) The valid bit indicate whether an entry contain a valid address.

In a memory hierarchy system, data and programs are first stored in secondary or auxiliary memory. Program and its related data are brought in main memory for execution. What if th

A three stage network is realized by using switching matrices of size p x s in stage 1, r x r matrices in stage 2 and s x p matrices in stage 3. Using the Lee's probability graph s

What do they signify Which one is critical for calculating maximum clock frequency of a circuit? Ans) Set up time constraint implies how late the input signal can arrive befor

Determine the advantages of BCD Adder Now let us see the arithmetic addition of two decimal digits in the BCD, with a possible carry from previous stage. As each input digit do

Techno hype - Obstacle to Information System New technology has always been accompanied by a certain amount of euphoria that inevitably leads to unrealistic expectations place

A router connects to at most K networks. How many routers R are required to connect to N networks? Derive an equation that gives R in terms of N and K. If N K and K >=2 this

Q. Programming with loops and comparisons? This segment deals with more practical illustrations employing comparison, loops and shift instructions. Simple Program Loops

Net-fu is a web-based interface to a script-fu server. The work is completed at a remote site. To see Net-fu, point your web browser or one of the mirror sites, and then go to "gim

Q. Interconnection network in the form of a Linear Array? The sorting problem particularly selected is bubble sort and interconnection network may be represented as n processor