* Re: Here is my thoughts on mathematical queuing theory...
[not found] <nb7lt2$8ob$1@dont-email.me>
@ 2016-03-24 1:46 ` rieachus
0 siblings, 0 replies; only message in thread
From: rieachus @ 2016-03-24 1:46 UTC (permalink / raw)
Two comments. First, if you want to do useful modelling of discrete event systems in Ada, it is worth the effort/agony to create your own time type. I've done it, but did not want to get entangled in supporting such a thing. Why? You don't really need a compiler that can mix tasks scheduled on your clock and on the system clock.
Anyway, you end up able to use the full vocabulary of Ada tasking to construct your model, and often the (simulated) system load is all you really need.
Second, Kleinrock (http://www.amazon.com/Queueing-Systems-Volume-1-Theory/dp/0471491101) is the classic reference on queuing theory. If you need to think about hypergeometric distributions, etc. It is a good place to start. However, it is very dense, although well written. Get a library copy before you commit to buying it. (I took a graduate course taught from it decades ago, and there were single breezy statements that took the prof AND the students hours to grind through.)
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2016-03-24 1:46 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
[not found] <nb7lt2$8ob$1@dont-email.me>
2016-03-24 1:46 ` Here is my thoughts on mathematical queuing theory rieachus
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox