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.6 required=5.0 tests=BAYES_05,INVALID_DATE,
	MSGID_SHORT autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!utgpu!water!watmath!clyde!rutgers!sri-spam!mordor!lll-tis!ames!pasteur!ucbvax!decvax!decwrl!sun!pitstop!sundc!seismo!uunet!mcvax!unido!iraun1!iravcl!gosch
From: gosch@iravcl.ira.uka.de
Newsgroups: comp.lang.ada
Subject: Implementation of tasking/Info ??
Message-ID: <33@iravcl.ira.uka.de>
Date: 19 Jan 88 20:03:42 GMT
Posted: Tue Jan 19 21:03:42 1988
Organisation: Universitaet Karlsruhe, IRA, F.R. Germany
List-Id: <comp.lang.ada>

I need information about some IMPLEMENTATION-Details concerning the
task facilities of Ada, e.g. SELECT-, ACCEPT-statements, indeterminstic
deciding models for the SELECT with more than one open alternative,
realization of task types, generics and so on.

In Karlsruhe we have a so called 'optimizing ADA-Compiler', but in all
documents concerning this they write of no code generated in case of
finding any generic or task-concerning source text! But I should mention,
that all these documents are from 1981 - 1983, and so may be revised yet.
Though I didn't find anything else about it here.

If you have some documental for me, please don't let it be of too big depth.
I am only interested in principles of really running tasking implementations.

Christian Gosch - Student at University of Karlsruhe, W.Germany

(For replying use SMOEREDROED as nickname - T H A N K S  A  L O T ! )