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=-0.0 required=3.0 tests=BAYES_40 autolearn=ham autolearn_force=no version=3.4.5-pre1 Date: 3 Sep 93 00:24:27 GMT From: magnesium.club.cc.cmu.edu!news.sei.cmu.edu!ajpo.sei.cmu.edu!carters@uunet .uu.net (Scott Carter) Subject: Looking for CIFO implementations in standard Ada Message-ID: <1993Sep2.202427.7061@sei.cmu.edu> List-Id: I am looking for public domain implementations of certain CIFO entries written in standard Ada. The performance of the code is completely irrelevant, and storage leaks are OK. I do need correct syntax and semantics, though :) This will only be used to do some initial testing of code in benign conditions, (with hopefully non-pathological usages), so warranty-free and not terribly robust code is also OK. This will be used for some Space Station code, so the desired compatibility is actually with the Alsys vX.Y CIFO (a mix of CIFO 2 and 3) implementations, but I'll take anything I can get. The most needed CIFO entry is Synchronous and Asynchronous Task Scheduling (however, this entry depends on Events, which I know ExTRA has done in ordinary Ada, and Dynamic Priorities, which seems to be at the least very tricky to do in standard Ada). A PD implementation of Events alone would be moderately useful. We also need Mutually Exclusive Access to Shared Data (is there any reason why the obvious implementation with a single hidden task per instantiation won't work?). Priority Inheritance Discipline would be nice but is not necessary. The target environment is a Rational, which lacks preemptive delay statements (this might affect the implementation of the Synchronous and Asynchronous Task Scheduling entry). Many thanks, Scott Carter McDonnell Douglas Electronic Systems Company MS A208 1801 East St Andrew Place, Santa Ana CA 92705 714-566-5741 FAX 714-566-4520 carter@klytus.mdc.com or scarter@cssgi.mdc.com