Performance and issues in pipelining-throughput, Computer Engineering

Assignment Help:

Performance and Issues in Pipelining

Throughput: Throughput of a pipeline can be defined as the number of results that have been getting per unit time. It can be denoted as:

                                                   T = n / [m + (n-1)]. c = E / c

Throughput signifies the computing power of the pipeline.

Maximum speed up, throughput and efficiency are the perfect cases but these are not achieved in the useful cases, as the speedup is limited due to the many factors:

  • Data dependency between successive tasks:There might be dependencies among the instructions of two tasks used in the pipeline. For example, one instruction cannot be going ahead until the previous instruction returns the results, as both are interdependent. One more instance of data dependency will be when that both instructions try to modify the similar data object. These are known as data hazards.
  • Resource Constraints: When resources are not available at the time of implementation then delays are caused in pipelining. For example, if single common memory is used for both instructions and data and there is require to read/write and fetch the instruction at the similar time then only one can be carried out and the other has to stay. One more example is of limited resource like implementation unit, which may be busy at the required time.
  • Branch Instructions and Interrupts in the program:A program is not a directly flow of sequential instructions. There may be branch instructions that modify the normal flow of program, which delays the pipelining implementation and affects the performance. Likewise, there are interrupts that postpones the implementation of next instruction until the interrupt has been serviced. Interrupt and the Branches have harmful effects on the pipelining.

Related Discussions:- Performance and issues in pipelining-throughput

Rank the list elements in terms of distance, Q. Rank the list elements in t...

Q. Rank the list elements in terms of distance? Rank the list elements in terms of distance from each to last element in given linear linked list. A parallel algorithm for t

What is the difference between a structure and a table, What is the differe...

What is the difference between a structure and a table? Structures are constructed the almost the similar way as tables, the only dissimilarity using that no database table is

Data structures for parallel algorithms, To apply any algorithm selection o...

To apply any algorithm selection of a proper data structure is very significant. An explicit operation might be performed with a data structure in a smaller time however it might n

Show the properties of frame tag, Q. Show the properties of Frame Tag? ...

Q. Show the properties of Frame Tag? This tag is used for placing an HTML file in the frame created. We should now tell browser what to put in every frame.

Address - operand data types, Q. Address - operand data types? A...

Q. Address - operand data types? Addresses : Operands residing in memory are specified by their memory address while operands residing in registers are specified by a re

How society is affected thorugh internet, How society is affected thorugh I...

How society is affected thorugh Internet Buying goods and services (for example banking) over the internet has both negative and positive aspects on society. These can be expl

Give the difference b/w multiprogramming and multiprocessing, Give the diff...

Give the difference between multiprogramming and multiprocessing. A multiprocessing system is a computer hardware configuration which contains more than one independent proc

Calculate number of trunks for time multiplexed space switch, Calculate the...

Calculate the number of trunks that can be supported on a time multiplexed space switch given that, 32 channels are multiplexed in each stream, while the control memory access time

What is an advantage of executing a process in background, What is an advan...

What is an advantage of executing a process in background? The most common reason to put a process in the background is to permit you to do something else interactively without

Code density and smaller faster programs, Q. Code Density and Smaller Faste...

Q. Code Density and Smaller Faster Programs? Memory was very expensive in older computer. So there was a need of less memory utilization, which is it was cost effective to have

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