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.236.229.195 with SMTP id h63mr11803054yhq.40.1412855877503; Thu, 09 Oct 2014 04:57:57 -0700 (PDT) X-Received: by 10.182.73.169 with SMTP id m9mr20915obv.27.1412855877318; Thu, 09 Oct 2014 04:57:57 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!uq10no7185320igb.0!news-out.google.com!bc9ni17237igb.0!nntp.google.com!h18no3747575igc.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Thu, 9 Oct 2014 04:57:57 -0700 (PDT) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=130.113.46.8; posting-account=Lb5doAoAAAAWHET3z2_nBVbFSXaZQG1V NNTP-Posting-Host: 130.113.46.8 User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: tasks in queue From: Stribor40 Injection-Date: Thu, 09 Oct 2014 11:57:57 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:22274 Date: 2014-10-09T04:57:57-07:00 List-Id: In this tutorial http://www.infres.enst.fr/~pautet/Ada95/e_c27_p3.ada it basically say that tasks are served by FIFO=20 "Considering all that we have said so far about tasking, you should underst= and that all three of these tasks begin execution at the same time and Bill= and John both request a hot dog immediately. Since there is only one entry= point, only one can be served at a time, and the Ada definition does not s= pecify which will be serviced first. It does specify that both will ultimat= ely be served, so there is an implicit queue at the entry point where reque= sts can be stored until they can be serviced in turn. All requests are serv= iced on a First In First Out (FIFO) basis with no concern for priority of t= asks (to be defined later). This queue is a "hidden" queue as far as you, t= he programmer, are concerned because you have no access to it. You cannot t= herefore, sort through the entries and redefine the order of execution of t= he various entry requests. The attribute named COUNT is available which wil= l return the number of requests pending on any entry queue. Its use will be= illustrated in the program named e_c29_p6.ada in chapter 29 of this tutori= al." But this explanation says also "the Ada definition does not specify which w= ill be serviced first". also if in the main you have something like.... calling .....First_Task calling..... Second_Task calling......Third_Task since this is sequentially executed doesn't that guarantee First_Task will = run first?