Read again...

[Ramine]

Hello..........


You have seen me posting about my USL for Delphi and FreePascal,
and i want to make clear my explanation..

If you download this free ebook and read it, here it is:

https://www.vividcortex.com/resources/universal-scalability-law/

You will notice that he is calculating mathematically the response
time of a database system of a type of transactions that is the "Read"
transactions and he is modeling and predicting the Scalability with
Universal scalability Law (USL), but i don't think that his way is a
better way to look at those database systems, because when
you put and expose the database system to internet and to database
queries from internet and the web , the inter-arrivals distribution of
the transactions will be Markovian and the service time of the database
system will be hyper-exponential, and this will complexify the
modeling of the overall system including the database system,
so what is then the solution ? i have given you a solution
that contains an approximation of an the hyper-exponential
service of he database system with an M/M/c queue using
queuing mathematical theory when the the load of the database system
is read-mostly , the approximation works when the "delete"
and "write" database transactions are less or equal to 30% of the
overall transactions , but this is not the end of the story ,
you have also to control the waiting time of the internet
users programmaticly to be able to limit the waiting time
of the users for a better QoS, and i have spook about that on
my previous posts, so my USL programs permit us to predict
scalability and to optimize the criterion of the cost for a
better QoS and my previous modeling of an Ecommerce that i have
showed you before using queuing theory and my suggestions about
how to control and limit the waiting-time of the internet
users is a good way to follow.



Thank you,
Amine Moulay Ramdane.

[Ramine]

Hello....


Universal Scalability Law (USL) for Delphi and FreePascal was updated to
version 2.7

I have just made it more robust, because my programs must catch
many errors in the format of the needed .csv file , i have just enhance
it to catch those errors using an automaton that uses an efficient
logic.. so i think now that my programs are stable and more robust,
so i think that you can be confident with version 2.7 of my software..
i have included the 32 bit and the 64 bit windows executables of
my programs inside the zip files to easy the job for those who don't
want to compile my programs themselves.

You can download my Universal Scalability Law (USL) for Delphi and
FreePascal version 2.7 from:

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

[Ramine]

Hello,

USL methodology is like a playing a Dice game with much greater
number of sides than 6..

When you want to test with fewer cores and fewer threads using
the USL methodology to predict scalability, the bigger serial parts
of the Amdahl's law that causes contention and the smallest serial parts
of the Amdahl's law that are much farther from the the smallest big
serial part that causes contention constitutes the greater majorities of
the sides of a Dice with much greater
number of sides than 6.., so there probability are , much higher, so
since the bigger serial parts that causes contention on the serial part
makes the nonlinear regression will succeed in predicting scalability..
and since for the smallest serial parts of the Amdahl's law that are far
from the smallest big parts that causes contention have a higher chance
to happen than the smallest serial parts that are near the smallest
bigger parts that causes contention, this is why when you test with
fewer cores and fewer threads with USL methodology there is a much
higher chance that the forecasting of scalability farther succeeds, that
means it's a better approximation.


This is all about mathematical probability, and my reasonning makes
USL methodology a successful and great tool that predict scalability.