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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,1356f4179c1e4ef4 X-Google-Attributes: gid103376,public From: "Marin David Condic, 407.796.8997, M/S 731-93" Subject: Re: ADA task Date: 1996/09/17 Message-ID: <96091716303787@psavax.pwfl.com>#1/1 X-Deja-AN: 183891183 sender: Ada programming language comments: Gated by NETNEWS@AUVM.AMERICAN.EDU x-vms-to: SMTP%"INFO-ADA@VM1.NODAK.EDU" newsgroups: comp.lang.ada x-vms-cc: CONDIC Date: 1996-09-17T00:00:00+00:00 List-Id: "Norman H. Cohen" writes: >The "delay until" statement is a new feature in Ada 95. In Ada 83 you >would write > > delay Next_Wakeup - Calendar.Clock; > >which delays for the specified amount of time (in this case, the time >from now until Next_Wakeup). > Out of curiosity & ignorance, is there anything in the LRM which guarantees some minimal latency or predictability with the "delay until" statement? I recall one of the big criticisms of Ada83 was that the "delay" statement (and other language semantics) made it very difficult, if not impossible, to write a task which could schedule itself in a predictable manner. (That is, if one wanted to fire off a task every 20 milliseconds, one would like to know that any fraction of scheduling error is detected and corrected in the next pass to the limit of the accuracy of the clock and that, if at all possible, you get no "jitter" in the interval between cycles.) MDC Marin David Condic, Senior Computer Engineer ATT: 561.796.8997 M/S 731-96 Technet: 796.8997 Pratt & Whitney, GESP Fax: 561.796.4669 P.O. Box 109600 Internet: CONDICMA@PWFL.COM West Palm Beach, FL 33410-9600 Internet: CONDIC@FLINET.COM =============================================================================== "Don't say yes until I finish talking." -- Darryl F. Zanuck ===============================================================================