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,dc89792b5613be6a
X-Google-Attributes: gid103376,public
From: Robert A Duff <bobduff@world.std.com>
Subject: Re: Converting Ada Tasks To VxWorks Tasks?
Date: 2000/04/14
Message-ID: <wccaeiwblzf.fsf@world.std.com>#1/1
X-Deja-AN: 611206736
Sender: bobduff@world.std.com (Robert A Duff)
References: <1crJ4.142$d21.18564@elnws01> <8d5ivg$ho9$1@nnrp1.deja.com>
Organization: The World Public Access UNIX, Brookline, MA
Newsgroups: comp.lang.ada
Date: 2000-04-14T00:00:00+00:00
List-Id: <comp.lang.ada>

Ted Dennison <dennison@telepath.com> writes:

>...If you want to exactly clone all of Ada's tasking semantics,
> you'll have a big job ahead of you.

Probably tens of thousands of lines of code.

>... For instance, I believe if you have
> a selective accept with multiple open and waiting accept alternatives,
> you have to *randomly* pick one to service.

No, that's not quite right.  The choice is "arbitrary" by default, which
means that the Ada run-time system can always pick the first one.  It is
not (necessarily) random.  If you select the Priority_Queuing policy,
then it's more deterministic: it always picks the first one (see
D.4(14)).

- Bob