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=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c0a32fc5a2c39b9
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-01-09 08:37:32 PST
Path: 
 nntp.gmd.de!newsserver.jvnc.net!nntpserver.pppl.gov!princeton!udel!news.mathworks.com!panix!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody
From: dewar@cs.nyu.edu (Robert Dewar)
Newsgroups: comp.lang.ada
Subject: Re: Task Scheduling in Applications Written in Ada
Date: 9 Jan 1995 11:37:32 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3erooc$h2@gnat.cs.nyu.edu>
References: <3erg9v$28h@caess8.cae.aro.allied.com>
NNTP-Posting-Host: gnat.cs.nyu.edu
Keywords: Real-Time Task Scheduling
Date: 1995-01-09T11:37:32-05:00
List-Id: <comp.lang.ada>

Dar, it would be most interesting to know in more detail what "scheduling
algorithms" you have in mind for accept, select etc.