Throughput

Throughput of a pipeline may be defined as number of results which have been achieved per unit time. It can be referred as:

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

Throughput indicates the computing power of a pipeline. 

Utmost efficiency, speed up and throughput are the ideal cases however these are not achieved in practical cases because the speedup is limited because of the subsequent factors:

• Data dependency between successive tasks: There can be dependencies between the instructions of two tasks used in pipeline. E.g. one instruction can't be started till the prior instruction yields the results as both are interdependent. Another Illustration of data dependency would be when that both instructions attempt to modify the same data object. These are termed as data hazards.

 

• Resource Constraints: When resources aren't accessible at the time of execution then delays are caused in pipelining. E.g. if one common memory is used for both instructions and data and there is need to read and write and fetch an instruction at the same instance then only one can be performed and the other has to wait. Another instance of limited resource such as execution unit that might be busy at the required time.

 

• Branch Instructions and Interrupts in the program: A program isn't a straight flow of serial instructions. There can be branch instructions which alter the general flow of program, which delays pipelining execution and influences the performance. In the same way, there are interrupts which postpones the execution of subsequent instruction till the interrupt has been serviced. Interrupts and Branches have damaging effects on the pipelining.

Posted Date: 7/13/2013 2:55:40 AM | Location : United States

Ask an Expert

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

Write discussion on Explain throughput performance and issues in pipelining
Your posts are moderated

Write your message here..

Related Questions

Find 9''s compliment of bcd number using 4-bit binary adder, Design a circu... Design a circuit for determining the 9's compliment of a BCD number by using 4-bit binary adder and some external logic gates? Compliment of a BCD number 9's co

What you mean by organizational effectiveness, Q. What you mean by organiza... Q. What you mean by organizational effectiveness? Organizational effectiveness is measured in terms of productivity, structural flexibility, Employee involvement and Job satisf

Advantage of wrapping database calls into mts transactions, Advantage of wr... Advantage of wrapping database calls into MTS transaction If database calls are complete within the context of a transaction, aborting the transaction will undo and changes that

Low level language program, The commands (instructions) are native instruct... The commands (instructions) are native instructions to the 68HC11 and therefore it is termed a low level language program. Examining the program the instructions (mnemonics) they a

Interactive graphics, what is panning what is panning

Determine the output of an even parity generator, When the set of input dat... When the set of input data to an even parity generator is 0111, the output will be ? Ans. Into even parity generator if number of one is odd then output will be 0.

What is swtiches, What is swtiches What is swtiches

Data communication, how CSMA protocol is improved through persistence metho... how CSMA protocol is improved through persistence methods & collition detection

Eequivalences rules, Eequivalences rules: This conveys a meaning that ... Eequivalences rules: This conveys a meaning that is actually much simpler so than you would think on first inspection.  Hence we can justify this, by using the following ch

COA, During instruction execution, there are other parts of the CPU that ca... During instruction execution, there are other parts of the CPU that can determine when a physical register might be freed. Briefly describe where else we can put freeing logic and