Hello....

I have to set it more right and more precise..

So here is my other proof again...

If the serial part of the Amdahl's law is bigger, you have
more chance to hit the contention, so there is more chance
that USL will give a good approximation of the predicted
scalability up to 10X the maximum number of cores and threads
of the performance data measurements.., but let say the serial part
of the Amdahl's law is bigger and is 1/4 the parallel part of the
Amdahl's law, and let say the parallel part is variable and it makes the
USL methodology escape the contention at fewer core and fewer threads,
the USL methodology will have much more chance at fewer cores
and fewer threads to give a good approximation up to 10X the maximum
number of cores and threads of the performance data measurements.., you
can feel and confirm it by statistically using more examples of the
follwing above cases and calculating it..

But if the serial part is smaller , so there is more chance that
USL methodology will escape contention at fewer core and fewer
threads. so there is more chance that USL will give a good approximation
of the predicted scalability up to 10X the maximum number of cores and
threads of the performance data measurements..

So overall. the USL methodology will be able to forecast scalability
with a better approximation up to 10X the maximum number of cores and
threads of the performance data measurements..


This is a good news i think, and this makes USL methodology a good
tool that is important and interesting to use.

I have included the 32 bit and 64 bit windows executables of my
programs inside the zip file to easy the job for you.

You can download my USL programs version 3.0 with the source code from:

https://sites.google.com/site/aminer68/universal-scalability-law-for-delphi-and-freepascal


Thank you,
Amine Moulay Ramdane.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)