Thursday, March 3, 2016

Digest for comp.programming.threads@googlegroups.com - 8 updates in 5 topics

Ramine <ramine@1.1>: Mar 02 04:33PM -0800

Hello....
 
 
 
Here is my thoughts on mathematical queuing theory...
 
I have read some books that explain mathematical queuing theory,
but i was not satisfied, because i was interesting in how to model
an Ecommerce website, but mathematical queuing theory on those
books have answered the question on how to fix the arrival rate
that is markovien, that means the inter-arrival are distributed in
an exponential manner, and i have read more books that talked about the
case when the database server have an hyper-exponential distribution
and i have understood how to model it mathematically when
the Ecommerce have a read-mostly workload with writer transactions
that are less or equal to 30% of the total transactions, but
queuing theory didn't answer all my questions, because mathematical
queuing theory does answer the question of what is the waiting time
of the internet user of the website when the waiting time is dependant
on the arrival rate that must not go beyond the Kned of the queues, but
this is not a sufficient condition to model the Ecommerce website,
because how can you fix efficiently the number of internet connections
on the webserver and how to have a control on the waiting time
efficiently in a dependant manner on the number of connections, the
mathematical queuing theory books that i have read have not answered
those questions, so i have come with a new algorithm that permit to have
an efficient control on the waiting time of the internet users of the
Ecommerce website, and that permit to fix efficiently the number of
internet connections on the webserver to have more control
on the waiting time for a better QOS, and for this i have come with a
new windows synchronization semaphore that is FIFO fair
and that optimize more the waiting time for a better QOS.
 
 
This was my second project.
 
 
Thank you,
Amine Moulay Ramdane.
bleachbot <bleachbot@httrack.com>: Mar 02 06:55PM +0100

bleachbot <bleachbot@httrack.com>: Mar 02 09:31PM +0100

bleachbot <bleachbot@httrack.com>: Mar 02 09:46PM +0100

bleachbot <bleachbot@httrack.com>: Mar 02 10:31PM +0100

Ramine <ramine@1.1>: Mar 02 03:48PM -0800

Hello.........
 
 
I was working all those previous days on my new projects,
i have worked on two projects, my first project cons=ist of
an optimal implementation that uses Dijkstra's algorithm with
a binary heap that takes a time complexity of E*log(V), V is
the number of vertices and E is the number of edges. This library can be
used in parallel clusters manner by dividing your graph in many parts to
speed much your parallel algorithm, also i have added an option that
permit you to pass the edges of the graph that you can substract from
your graph to be able to give you algorithm more control if you want for
example to ignore congestions in some roads...
 
This was my first project that i am finishing.
 
My second project is about capacity planning , i have come
with an algorithm that permit you to fix the number of internet
connections easily and have control on the waiting time
of the internet users that are using for example your Ecommerce
website, my new algorithm uses a new semaphore that is
FIFO fair because it must be FIFO fair to be be more optimal,
and i will also show you how to model an Ecommerce with queuing
theory that contain a queue with an hyperexponential service that
can be approximated with an M/M/1 queue when the writer transactions are
less or equal to 30% of the total transactions and the Ecommerce have a
read-mostly workload.
 
 
I am right now finishing my second project.
 
 
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Mar 02 03:34PM -0800

Hello,
 
 
I was working all those previous days on my new projects,
i have worked on two projects, my first project cons=ist of
an optimal implementation that uses Dijkstra's algorithm with
a binary heap that takes a time complexity to E*log(V), V is
the number of vertices and E is the number of edges. This library can be
used in parallel clusters mannerby dividing your graph in many parts to
speed much your parallel algorithm, also i have added an option that
permit you to pass the edges of the graph that you can substract from
your graph to be able to give you algorithm more control if you want for
example to ignore congestions in some roads...
 
This was my first project that i am finishing.
 
My second project is about capacity planning , i have come
with an algorithm that permit you to fix the number of internet
connections easily and have control on the waiting time
of the internet users that are using for example your Ecommerce
website, my new algorithm uses a new semaphore that is
FIFO fair because it must be FIFO fair to be be more optimal,
and i will also show you how to model an Ecommerce with queuing
theory that contain a queue with an hyperexponential service that
can be approximated with an M/M/1 queue when the writer transactions are
less or equal to 30% of the total transactions and the Ecommerce have a
read-mostly workload.
 
 
I am right now finishing my second project.
 
 
 
 
Thank you,
Amine Moulay Ramdane.
zmodeler3 crack crack <nawirtjmorawa2@gmail.com>: Mar 02 09:55AM -0800

Appportunity - Mobile App Product For Apple And Android App! (view mobile)
Mobile App - The Hottest Topic! Crazy Offer - We're Offering 98% Discount On Our Premier Appportunity Program On How To Build Mobile Android Apps And Apple Ios Apps Business!
 
for more information
http://642deecrveuldd7cja-mp4tbwi.hop.clickbank.net/?tid=ANDROID+GAMES
You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page.
To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)