From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 15 Oct 92 17:45:15 GMT
From: kronos.arc.nasa.gov!iscnvx!news@ames.arc.nasa.gov
Subject: Re: Ada and real-time
Message-ID: <92289.38337.LJ10891@LMSC5.IS.LMSC.LOCKHEED.COM>
List-Id: <comp.lang.ada>

------------------------- Original Article -------------------------
   I have heard of rate-monotonic scheduling.  Are there any other scheduling
theories which might be applicable to Ada tasking and which also provide a
means of conclusively demonstrating that some or all time constraints will
be satisfied?  If so, could you please point me towards the appropriate
references.

                            Trey Haddad (ghaddad@lmsc.lockheed.com)
I found these opinions on my doorstep, could you please give them a good home?