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, MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,f495c7652c09dd8c X-Google-Attributes: gid103376,public From: dennison@telepath.com Subject: Re: Does this model work ? Date: 1999/05/19 Message-ID: <7hun2e$7eg$1@nnrp1.deja.com>#1/1 X-Deja-AN: 479647529 References: <373e38e2.31311363@news2.ibm.net> <7hhj6q$cjn$1@nnrp1.deja.com> <7hmda1$khp$1@nnrp1.deja.com> <7hs6in$g8p$1@nnrp1.deja.com> <7ht5cp$531$1@nnrp1.deja.com> X-Http-Proxy: 1.0 x38.deja.com:80 (Squid/1.1.22) for client 204.48.27.130 Organization: Deja.com - Share what you know. Learn what you don't. X-Article-Creation-Date: Wed May 19 15:58:08 1999 GMT Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.6 [en] (WinNT; I) Date: 1999-05-19T00:00:00+00:00 List-Id: In article <7ht5cp$531$1@nnrp1.deja.com>, Robert Dewar wrote: > In article <7hs6in$g8p$1@nnrp1.deja.com>, > dennison@telepath.com wrote: > > The part of my post that you snipped was talking about a > > > program that contained multiple intercommunicating tasks in a > > Rate-monotonic system using a custom frequency-based > > scheduler. Are you saying that it is > > possible to write perfectly portable code in COBOL, Fortran, > > or C that can do that? > > Probably not, in fact it would not even be possible to do this > in Ada 83, so I assume you are talking about an Ada 95 > implementation here, using a compiler which is Annex D > compliant. Correct on all three counts. I once had to implement pretty much the same thing in Ada 83. Due to the lack of "delay until", I had to use several non-portable features and an OS call. Fortunately, those problems are now ancient history. -- T.E.D. --== Sent via Deja.com http://www.deja.com/ ==-- ---Share what you know. Learn what you don't.---