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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ab549d7e16193bf7
X-Google-Attributes: gid103376,public
From: "Pat Rogers" <progers@acm.org>
Subject: Re: ATC---The Holy Grail of Ada Tasking?
Date: 1998/07/10
Message-ID: <6o5lsk$c7c$1@uuneo.neosoft.com>#1/1
X-Deja-AN: 370266558
References: <slrn6p3tph.q9p.franke@paxp01.mipool.uni-jena.de>
 <35A2C41D.F22CAE9E@aonix.com> <dewar.899945858@merv>
 <slrn6qcbum.7j2.franke@paxp12.mipool.uni-jena.de>
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.2106.4
Organization: NeoSoft, Inc.  
Newsgroups: comp.lang.ada
Date: 1998-07-10T00:00:00+00:00
List-Id: <comp.lang.ada>


Frank Ecke wrote in message ...

<snip>

>   The point is that I am currently writing a project alfa core in which I
am
>investigating and comparing the concurrency features of Ada, CHILL, and
Java.
>This, however, requires me to scrutinize each and every aspect of
concurrency
>in these languages.


In that case, if you haven't already done so, I strongly suggest you have an
extended look at Burns and Wellings' book titled Concurrency In Ada, second
edition (1998), Cambridge University Press, ISBN 0-521-62911-X.  Every
aspect of the Ada 95 tasking model is covered in great detail.