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 />
The graphs have values N p of 4, 16, 64, 256 <strong>and</strong> 1024. Notice that as the value N p<br />
increases, the area under the curve decreases, meaning that the non-parallizable part of<br />
the serial program has a greater effect <strong>and</strong> the degeneration occurs faster as N p increases.<br />
Amdahl’s intention was to show “the continued validity of the single processor approach<br />
<strong>and</strong> of the weaknesses of the multiple processor approach”. His paper proposed<br />
arguments to support his proposal, such as:<br />
• “The nature of this overhead appears to be sequential so that it is unlikely to be<br />
amenable to parallel processing techniques.”<br />
• “A fairly obvious conclusion which can be drawn at this point is that the effort<br />
expended on achieving high parallel performance rates is wasted unless it is<br />
accompanied by achievements in sequential processing rates of very nearly the<br />
same magnitude.”<br />
Gustafson’s Law<br />
In 1988, John L. Gustafson proposed the notion that massively parallel processing was<br />
beneficial because Amdahl’s law implies that the parallel part of the computation <strong>and</strong> the<br />
number of processors is independent [ lxiii ]. He proposed a formula for a scaled speedup<br />
based on an observation that in most real world computations “the problem size scales<br />
with the number of processors”. His proposed formula is:<br />
S =<br />
fraction _ serial + ( fraction _ parallel × number _ of _ processors)<br />
( fraction _ serial + fraction _ parallel = 1)<br />
Fs<br />
+ (1 − Fs<br />
) × N<br />
p<br />
=<br />
F + (1 − F )<br />
s<br />
s<br />
=<br />
F + (1 − F ) × N<br />
s<br />
1<br />
s<br />
p<br />
= F + N<br />
s<br />
p<br />
− N<br />
p<br />
F<br />
s<br />
= N<br />
p<br />
+ ( F − N F )<br />
s<br />
p<br />
s<br />
= N<br />
p<br />
+ (1 − N<br />
p<br />
) × F<br />
s<br />
104