Synergy User Manual and Tutorial. - THE CORE MEMORY
Synergy User Manual and Tutorial. - THE CORE MEMORY
Synergy User Manual and Tutorial. - THE CORE MEMORY
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Synergy</strong> <strong>User</strong> <strong>Manual</strong> <strong>and</strong> <strong>Tutorial</strong><br />
Petri Net<br />
Amdahl’s Law<br />
Gene Amdahl, a computer architect, entrepreneur, former IBM employee <strong>and</strong> one of the<br />
creators of the IBM System 360 architecture, devised this method in 1967 to determine<br />
the maximum expected improvement to a system when only part of it has been improved.<br />
He presented this as an argument against parallel processing. This law is similar to the<br />
law of diminished returns, which states that as more input is applied, each additional<br />
input unit will produce less additional output. Amdahl’s law states that a number of<br />
functions or operations must be executed sequentially, decreasing a computer’s speed<br />
when more processors are added. In other words, the number of tasks that must be<br />
completed sequentially limits computational speedup. This causes a bottleneck in the<br />
workflow, slowing the overall task. However as the size of a task increases the effect of<br />
Amdahl’s law decreases. The speedup of a system is:<br />
unimproved _ time<br />
= speedup =<br />
improved _ time<br />
performance _ with _ improvement<br />
performance _ without _ improvement<br />
If you make an improvement that greatly increases performance (maybe 100 times or<br />
more) in part of a computation but the overall improvement is only 25 percent, then the<br />
upper limit for speedup S is:<br />
S<br />
unimproved _ time<br />
=<br />
improved _ time<br />
1.00<br />
= = 1.333<br />
1.00 − 0.25<br />
Note: The unimproved execution time is 1.00 = 100% because this example makes use of<br />
the ratio between the two times, not the actual values. Assume that an unimproved<br />
computation takes 4 seconds <strong>and</strong> the improved computation takes 3 seconds. The<br />
equation is:<br />
S<br />
unimproved _ time<br />
=<br />
improved _ time<br />
=<br />
4sec<br />
3sec<br />
= 1.333<br />
If the improved computation is taken to be 100 percent performance, then by the<br />
relationship above the unimproved computation has 75 percent performance with respect<br />
to the improved.<br />
101