Re: Answer to 'a question'

[agnew@trwrc.UUCP (R.A. Agnew)]

In article <2181@cxsea.UUCP> young@cxsea.UUCP (Gary Young) writes:
>|>My question is: Are those entry calls queued in the order of calls?
>|>YES. ... The key is that the execution of the
>
>Unfortunately, you are assuming a single processor system.  In any distributed
>or multiprocessor system, where calls are implemented via message exchange,

Wrong! Not in any OS. In a properly designed real-time, multiprocessor,
Ada OS, where tasking across machine boundaries is implemented via messages,
the design of the bus insures that the messages are received in the order
that they are sent out. A common solution is a ring bus such as the SAE-9B
token-passing ring. Why would the communication of a rendezvous over a
interprocessor bus between run-time systems in different kernals be any
different than passing a message from a task to a run-time kernal
in the same processor via system services? There are many synchronization
problems to be reconed with in these implementations and that is why it has
taken Ada contractors over five years to get even close to a solution.
As an example all processors are synchronized within nanoseconds by a
"heartbeat" signal and messages are time-tagged to resolve ambiguities between
real-time events.

	********** These opinions are solely my own **************