Performance and issues in pipelining-throughput, Computer Engineering

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.
Posted Date: 3/4/2013 4:25:33 AM | Location : United States







Related Discussions:- Performance and issues in pipelining-throughput, Assignment Help, Ask Question on Performance and issues in pipelining-throughput, Get Answer, Expert's Help, Performance and issues in pipelining-throughput Discussions

Write discussion on Performance and issues in pipelining-throughput
Your posts are moderated
Related Questions
The various memory allocation functions are described below: (i) malloc( ) : It is a memory allocation function that assigns requested size of bytes and returns a pointer to t

a. Define the meaning of "Document & Finger print" and "Message & Message Digest". What's the difference among the 2 pairs? b. Describe Davies Meyer scheme with diagram. c. W

This comes at the complication time, If we give the LOGO option to the compiler, it take a bitmap file (i.e., ) as logo previous to loading the Application.

Which interface converts SQL requirements in the SAP development system to those of the database? Database Interface converts SQL in the SAP.

Q. Show the Programmes for Parallel Systems? Adding elements of an array using two processor      int sum, A[ n] ;  //shared variables

Explain the High Level Language? The programming language such as FORTRAN, C, or Pascal that enables a programmer to write programs those are more or less independent of a parti

Environments: We have seen that an agents intelligent should take into account certain information when it choose a rational action, including information from its sensors, in

write a java program to board coloring

Q. Show the Simple Arithmetic Application? The question is why can't we simply employ XCHG instruction with 2 memory variables as operand? To answer the question let's look int

What is loader? Loader is a system software which having a set of utility programs. It will load the object program to the memory.