Software Architect - Computer Organization and Architecture - pipeline computing

Example: The instruction pipeline is divided into three instructions, instruction A (2 seconds), the instruction B (2 seconds), the instruction C (1 second). How much demand cycle? 100 instruction completion time is how much? 100 instruction throughput is how much?

Period: the longest time, a maximum of 2 seconds

100 instructions Time:

Theoretical formula: (A + B + C) + (100-1) * Period = (2 + 2 + 1) * (2 * 99) = 203 seconds

Practice of the formula: (the number of instruction cycles *) + (100-1) * Cycle = (3 * 2) + (99 * 2) = 204 seconds

Note: multiple choice options in the general theory of probability formula is 80%. If there is no theoretical result of the formula, the answer is practice formula

Throughput:

Number of instructions / 100 instructions time = 100/203 

The maximum throughput of the pipeline:

1 / Cycle Time = 1/2

Pipeline speedup:

Time without using a pipeline / pipeline when use = ((2 + 2 + 1) * 100) / 203 = 500/203

 

Guess you like

Origin www.cnblogs.com/myunity/p/11776139.html