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

Evaluation functions, Evaluation Functions: Evaluation functions calcu...

Evaluation Functions: Evaluation functions calculate approximately the score which can be prove of guaranteed if a particular world state is reached. Same like in chess, evalu

Operation research, how to implement a modified distribution method using c...

how to implement a modified distribution method using c/c++

Write a menu driven program, Q. Write a Menu driven program to convert the...

Q. Write a Menu driven program to convert the given Decimal number into Binary, Octal and Hexadecimal number. (Fractional numbers are allowed)

What are vectored interrupts, What are vectored interrupts? To decrease...

What are vectored interrupts? To decrease the time involved in the polling process, a device requesting an interrupt may recognize itself directly to the processor. Then the pr

How firewalls operate, Firewalls operate by Creening packets to/from th...

Firewalls operate by Creening packets to/from the Network and give controllable filtering of network traffic.

Hill climbing - artificial intelligence, Hill Climbing - Artificial Intelli...

Hill Climbing - Artificial Intelligence: As we've seen, in some problems, finding the search path from primary to goal state is the point of the exercise. In other problems, t

Explain hybrid network in standard telephone hand set, Explain Hybrid Netwo...

Explain Hybrid Network in Standard Telephone hand set. Hybrid network: The hybrid network (sometimes termed as a duplex coil or hybrid coil) in a telephone set is a particula

Explain the working of assembler, Explain the working of Assembler? An ...

Explain the working of Assembler? An assembler is the computer program for translating assembly language fundamentally a mnemonic representation of machine language into object

Explain metadata, What is metadata? Metadata is data that explains anot...

What is metadata? Metadata is data that explains another data. Class definition is metadata. Models are inherently metadata as they explain the things being modeled.

What do you mean by complexity of an algorithm, What do you mean by complex...

What do you mean by complexity of an algorithm? The term complexity is used to define the performance of an algorithm. Typically performance is calculated in terms of time or s

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