Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #6439 > unrolled thread
| Started by | fir <profesor.fir@gmail.com> |
|---|---|
| First post | 2016-04-08 15:15 -0700 |
| Last post | 2016-04-08 15:15 -0700 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.programming
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: My explanation about USL ... fir <profesor.fir@gmail.com> - 2016-04-08 15:15 -0700
| From | fir <profesor.fir@gmail.com> |
|---|---|
| Date | 2016-04-08 15:15 -0700 |
| Subject | Re: My explanation about USL ... |
| Message-ID | <3bfb98e8-fb87-4c7b-9f03-dfedc8ec8a89@googlegroups.com> |
W dniu piątek, 8 kwietnia 2016 23:34:02 UTC+2 użytkownik Ramine napisał: > 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 > scalabilityand 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. get off stupid spamer, how many trash will you generate on such things three hundred spams a year?
Back to top | Article view | comp.programming
csiph-web