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,d69420c8e0f39b97
X-Google-Attributes: gid103376,public
From: elaine.waybright@pcisys.net
Subject: Re: Tasking newbee
Date: 1997/04/05
Message-ID: <3346895f.319048532@news.pcisys.net>#1/1
X-Deja-AN: 230944747
References: <33412898.2A8C@INnet.be>
Organization: PCI Systems Inc.
Newsgroups: comp.lang.ada
Date: 1997-04-05T00:00:00+00:00
List-Id: <comp.lang.ada>


On Tue, 01 Apr 1997 17:24:08 +0200, Sebastien Pochic
<spochic@INnet.be> wrote:

>hi,
>
> could someone explain what I should do so that the small tasks (without
>the loop) will end before the "big" task (with the loop), in my example
>it first counts the loop before even beginning the other tasks..
>here's my example:
>
>
"Extended rendezvous" (accept .. do ... end) should only be used if
the caller and callee have to be synchronized during the entire
rendezvous. Typically, this is the case if the callee protects some
shared resource that the caller wants to access.

In your case, you want the caller to trigger First_Task to start its
computation and then go back to its business of starting the other
task(s). In that case, you should use the simple rendezvous;
accept .. ; for i in .. loop etc. That is, the lengthy computation is
removed from the rendezvous and executed immediately after by the
callee.

Bo Sanden

Professor Bo Sanden
Colorado Technical University
Colorado Springs

Author of Software Systems Construction with Examples in Ada
(Prentice-Hall)