From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.13.242.134 with SMTP id b128mr3688414ywf.28.1458784004492; Wed, 23 Mar 2016 18:46:44 -0700 (PDT) X-Received: by 10.182.144.226 with SMTP id sp2mr66724obb.13.1458784004304; Wed, 23 Mar 2016 18:46:44 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!feeder2.usenet.farm!feeder.erje.net!2.us.feeder.erje.net!news.glorb.com!b101no13260qga.1!news-out.google.com!u9ni4688igk.0!nntp.google.com!av4no1769846igc.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Wed, 23 Mar 2016 18:46:43 -0700 (PDT) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=2601:191:8201:bb5a:5985:2c17:9409:aa9c; posting-account=fdRd8woAAADTIlxCu9FgvDrUK4wPzvy3 NNTP-Posting-Host: 2601:191:8201:bb5a:5985:2c17:9409:aa9c References: User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: Here is my thoughts on mathematical queuing theory... From: rieachus@comcast.net Injection-Date: Thu, 24 Mar 2016 01:46:44 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:29860 Date: 2016-03-23T18:46:43-07:00 List-Id: 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 y= our clock and on the system clock. Anyway, you end up able to use the full vocabulary of Ada tasking to constr= uct your model, and often the (simulated) system load is all you really nee= d. Second, Kleinrock (http://www.amazon.com/Queueing-Systems-Volume-1-Theory/d= p/0471491101) is the classic reference on queuing theory. If you need to t= hink about hypergeometric distributions, etc. It is a good place to start.= However, it is very dense, although well written. Get a library copy bef= ore you commit to buying it. (I took a graduate course taught from it deca= des ago, and there were single breezy statements that took the prof AND the= students hours to grind through.) =20