Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!bloom-beacon!think!ames!elroy!mahendo!jplgodo!wlbr!scgvaxd!trwrb!trwrc!agnew
From: agnew@trwrc.UUCP (R.A. Agnew)
Newsgroups: comp.lang.ada
Subject: Re: processing order
Message-ID: <217@trwrc.UUCP>
Date: Thu, 3-Sep-87 16:13:39 EDT
Article-I.D.: trwrc.217
Posted: Thu Sep  3 16:13:39 1987
Date-Received: Sat, 5-Sep-87 15:26:04 EDT
References: <8708292239.AA14468@ucbvax.Berkeley.EDU>
Reply-To: agnew@trwrc.UUCP (R.A. Agnew)
Organization: TRW/MEAD San Diego, Ca.
Lines: 15

In article <8708292239.AA14468@ucbvax.Berkeley.EDU> HEARNE@wwu.EDU writes:
>
>Entry calls are not processed in sending order.  In some systems,
>such as ones in which the callers resided on different processors,
>the adminstrative overhead and, in some cases, waiting would
>be intolerable.
>
>--Jim Hearne

Maybe thats true in some systems but it can't be true in embedded
real-time systems. (remember what Ada is for)
If it is true, then I've got a few million dollars worth of real-time
systems sitting out here that are never going to work! I'm going to talk
to the run-time kernal designer about it right now. Does the Stanford
system have that problem?