Explain speedup performance and issues in pipelining, Computer Engineering

Assignment Help:

Speedup

First, we take the speedup factor which is we see how much speed up performance we achieve by pipelining. First we take ideal case for measuring the speedup.

Let n be total number of tasks executed during m phases of pipelines. 

Then m phases can process n tasks in clock cycles = m + (n-1)

Time taken to execute with no pipelining = m.n 

Speedup because of pipelining = m.n/ [m + (n-1)]. 

As n>= ∞ There is speedup of n times over non-pipelined execution.

 


Related Discussions:- Explain speedup performance and issues in pipelining

Explain about interrupt cycle, Q. Explain about Interrupt Cycle? On com...

Q. Explain about Interrupt Cycle? On completion of execute cycle the current instruction execution gets completed. At this point a test is made to conclude whether any enabled

What is domain explain, Q. What is Domain explain? Domain can be an apa...

Q. What is Domain explain? Domain can be an apartment complex, a town or even a country. Sub-domains can correspond to organizations like expertsmind. United States comes under

What is the difference between tcp and udp, TCP and UDP are both transport-...

TCP and UDP are both transport-level protocols. TCP is designed to give reliable statement across a variety of reliable and unreliable networks and internets. UDP gives a conne

Minimax algorithm - artificial intelligence, Minimax algorithm - artificial...

Minimax algorithm - artificial intelligence: The minimax algorithm is so called because it assumes that you and your opponent are going to act rationally, so that if you will

Neural network for two predictors thickness, 2) Consider the following neur...

2) Consider the following neural network for two predictors Thickness and Alignment and two classes Print Quality High and Low. Some weights are shown in the table, including weigh

Write a subroutine in c for toggling the cursor, Write a subroutine in C fo...

Write a subroutine in C for toggling the cursor using old directives. ; ; use small memory model for C - near code segment _DATA SEGMENT WORD   'DATA'   CURVAL EQU   [B

Approach to reasoning - first-order logic, Approach to reasoning - first-or...

Approach to reasoning - first-order logic: The formal approach to reasoning has bigger return and disadvantages. In generally we notice, if a computer program has proved somet

Can the size of an array be declared at runtime, Can the size of an array b...

Can the size of an array be declared at runtime?              No, the size of an array can't be declared at run time, we always require to mention the dimensions of an array at

Explain about quine mckluskey method, Q. Explain about Quine McKluskey Meth...

Q. Explain about Quine McKluskey Method? A tabular method was proposed to deal with increasing number of variables called Quine McKluskey Method. This method is appropriate for

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