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

What is instruction cycle, What is Instruction Cycle A program residing...

What is Instruction Cycle A program residing in the memory unit of the computer having of a sequence of instructions.  The program is implemented in the computer by going throu

File structures, Write in brief about UNIX process structure.

Write in brief about UNIX process structure.

Explain the program invisible registers, What are program invisible registe...

What are program invisible registers? Global and local descriptor tables are found in memory system. In order to specify and access the address of these tables, program invisi

Illustrate left shift register with parallel load, Q. Illustrate Left shift...

Q. Illustrate Left shift register with parallel load? A register that shifts data in one direction only is known as Uni-directional shift register and a register that can shift

What is circular shift, What is Circular shift The circular shift is al...

What is Circular shift The circular shift is also called as rotate operation. It circulates bits of the register around two ends and there is no loss of information. This is do

Describe the various signalling techniques, Describe the various signalling...

Describe the various signalling techniques. Signaling systems link the variety of transmission systems, switching systems and subscriber elements in telecommunication network

When should the method invokelater() be used, This method is used to make s...

This method is used to make sure that Swing components are updated by the event-dispatching thread.

Find out the hexadecimal sum, Find the hex sum of (93) 16 + (DE) 16 ? Ans...

Find the hex sum of (93) 16 + (DE) 16 ? Ans. Hex Sum of (93) 16 + (DE) 16 Convert Hexadecimal numbers 93 and DE to there binary equivalent demonstrated below:- Hence (9

Automatic typewriter in information distribution, Automatic typewriter : I...

Automatic typewriter : It is a power-driven machine, which automatically types a standard pro forma from a previously punched or stencilled master. When the master is placed on th

Why process scheduling algorithm favour i/o bound processes, Suppose that a...

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,

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