28.10.2014 Views

Synergy User Manual and Tutorial. - THE CORE MEMORY

Synergy User Manual and Tutorial. - THE CORE MEMORY

Synergy User Manual and Tutorial. - THE CORE MEMORY

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Synergy</strong> <strong>User</strong> <strong>Manual</strong> <strong>and</strong> <strong>Tutorial</strong><br />

where S is the speedup, the serial portion is F s <strong>and</strong> N p is the number of processors.<br />

Again, assume that F s = 0.06. Then F p = 1–F s = 0.94. For 4 processors:<br />

S<br />

= N<br />

p<br />

p s<br />

+ ( 1−<br />

N ) × F = 4 + (1 − 4) × 0.06 = 4 − 0.18 = 3.82<br />

The table <strong>and</strong> graphs below show the same data as in Amdahl but using Gustafson’s law.<br />

Processors(N) 1 2 4 8 16 32 64 128 256 512 1024<br />

Run Time 1024.0000 527.8351 268.0628 135.0923 67.8146 33.9748 17.0043 8.5064 4.2543 2.1274 1.0638<br />

Speedup 1.0000 1.9400 3.8200 7.5800 15.1000 30.1400 60.2200 120.3800 240.7000 481.3400 962.6200<br />

Efficiency 100.00% 97.00% 95.50% 94.75% 94.38% 94.19% 94.09% 94.05% 94.02% 94.01% 94.01%<br />

Cost 1.0000 1.0309 1.0471 1.0554 1.0596 1.0617 1.0628 1.0633 1.0636 1.0637 1.0638<br />

4<br />

4<br />

16<br />

16<br />

65<br />

65<br />

3.95<br />

15.8<br />

64<br />

15.6<br />

4 ( 1 4) F<br />

3.9<br />

16 ( 1 16) F<br />

.<br />

64 1 F 64 ( )<br />

63<br />

15.4<br />

3.85<br />

15.2<br />

62<br />

3.82<br />

. 0.06<br />

3.8<br />

0 0.01 0.02 0.03 0.04 0.05 0.06<br />

0 F<br />

15.1<br />

. 0.06<br />

15<br />

0 0.01 0.02 0.03 0.04 0.05 0.06<br />

0 F<br />

61.16<br />

61<br />

0 0.01 0.02 0.03 0.04 0.05 0.06<br />

0 F<br />

0.06<br />

260<br />

256<br />

1040<br />

1.024 . 10 3<br />

255<br />

1020<br />

256 ( 1 256) F 250<br />

. 0.06<br />

1024 ( 1 1024) F1000<br />

. 0.06<br />

245<br />

980<br />

240.7 240<br />

0 0.01 0.02 0.03 0.04 0.05 0.06<br />

0 F<br />

Consider the following diagrams, which are similar to those in Gustafson’s paper:<br />

Time = s A + p A = 1<br />

s A<br />

p A<br />

Single Processor<br />

962.62<br />

960<br />

0 0.01 0.02 0.03 0.04 0.05 0.06<br />

0 F<br />

s A<br />

p A /N p<br />

N Processors<br />

Time = s A + p A /N p<br />

105

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!