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,97ae587931c0f702
X-Google-Attributes: gid103376,public
From: mfb@mbunix.mitre.org (Michael F Brenner)
Subject: Re: Ada Task priorities
Date: 1997/01/27
Message-ID: <5cj01d$oft@top.mitre.org>#1/1
X-Deja-AN: 212578342
references: <kmradke-2601971335300001@dip7.inav.net>
organization: The MITRE Corporation, Bedford Mass.
newsgroups: comp.lang.ada
Date: 1997-01-27T00:00:00+00:00
List-Id: <comp.lang.ada>


Responding to the question about making tasks A, B, and C run 
sequentially, such that B does not start until A finished, and 
C does not start until A and B finishes. 

This is not a task priority question. Task priorities determine when
a task may start with respect to other tasks starting, not with respect
to their finishing. This is a sequential requirement which must be
programmed sequentially. One way to do this is to invoke entry points
in the 3 tasks like this: 
    loop
      if a is ready then a; 
                         if b is ready then b;
                                            if c is ready then c;
                                            end if;
                         end if;
      elsif b is ready then 
                         if c is ready then c;
                         end if;
      elsif c is ready then
                         c;
      end if;
    end loop;

Of course, then there is no reason to make a, b, and c tasks at all.
Instead the above code could be the main loop of a single task.