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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,4c86cf2332cbe682 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1995-02-08 15:12:57 PST Path: nntp.gmd.de!news.rwth-aachen.de!newsserver.rrzn.uni-hannover.de!aix11.hrz.uni-oldenburg.de!uniol!zib-berlin.de!news.mathworks.com!udel!gatech!howland.reston.ans.net!newsserver.jvnc.net!netnews.summit.novell.com!netnews.summit.novell.com!not-for-mail From: jls@summit.novell.com (Schilling J.) Newsgroups: comp.lang.ada Subject: Re: Passive tasks (was: bounded strings) Date: 8 Feb 1995 10:22:53 -0500 Organization: Novell, Summit Message-ID: <3hankdINN5d1@marble.summit.novell.com> References: <3grvi1$jvm@gnat.cs.nyu.edu> NNTP-Posting-Host: marble.summit.novell.com Date: 1995-02-08T10:22:53-05:00 List-Id: In article <3grvi1$jvm@gnat.cs.nyu.edu> dewar@cs.nyu.edu (Robert Dewar) writes: [thread regarding passive task optimizations] >However, it turned out to be harder than expected to do this optimization, >so many vendors did not get around to it (verdix is a notable exception). Several other vendors did it as well, including DDC-I and Telesoft. The paper "Automatic Compiler Recognition of Monitor Tasks" in ACM Ada Letters May/June 1994 discusses different approaches to the optimization and also gives some additional references on the subject. -- Jonathan Schilling Novell, UNIX Systems Group jls@summit.novell.com