Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!caip!topaz!nike!ucbcad!ucbvax!MITRE-BEDFORD.ARPA!sdl
From: sdl@MITRE-BEDFORD.ARPA (Litvintchouk)
Newsgroups: net.lang.ada
Subject: Compiler optimizations of Ada tasking wanted
Message-ID: <8607081942.AA12024@mitre-bedford.ARPA>
Date: Tue, 8-Jul-86 15:42:32 EDT
Article-I.D.: mitre-be.8607081942.AA12024
Posted: Tue Jul  8 15:42:32 1986
Date-Received: Thu, 10-Jul-86 00:26:28 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The MITRE Corp., Bedford, MA
Lines: 25



I am interested in finding out what kinds of optimizations are
employed by various Ada compilers to optimize the code of various Ada
tasking constructs.  The only optimization I am familiar with is the
Habermann-Nassi optimization of task rendezvous context switching
(where the code of accept statements is executed by the caller in
certain cases of tasking).

I am interested in tasking optimizations which are either a)
automatically applied, or b) require the user to supply special
pragmas to trigger the optimization.

Please reply directly to me; I will post a summary to the net.  Thanx
very much in advance.


Steven Litvintchouk
MITRE Corporation
Burlington Road
Bedford, MA  01730
(617)271-7753

ARPA:  sdl@mitre-bedford
UUCP:  ...{allegra,decvax,genrad,ihnp4,philabs,security,utzoo}!linus!sdl