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-Thread: 103376,6f24e26ea2e03c4
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news3.google.com!feeder2.cambriumusenet.nl!feed.tweaknews.nl!85.158.31.10.MISMATCH!newsfeed-0.progon.net!progon.net!newsfeed.ision.net!newsfeed2.easynews.net!ision!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Wed, 24 Mar 2010 15:55:45 +0100
From: Georg Bauhaus <rm.dash-bauhaus@futureapps.de>
User-Agent: Thunderbird 2.0.0.24 (Macintosh/20100228)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Threadpool with priority version 1.1 ...
References: <21e6697e-fd7c-4c5e-93dc-8d894449b5e6@f8g2000yqn.googlegroups.com>
 <ff3671a8-cf19-4cee-8b71-305bb6b1e9c1@l25g2000yqd.googlegroups.com>
 <4ba9e189$0$6886$9b4e6d93@newsspool2.arcor-online.net>
 <1id5xnuz0x892$.1odbic5ppiv07.dlg@40tude.net>
In-Reply-To: <1id5xnuz0x892$.1odbic5ppiv07.dlg@40tude.net>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Message-ID: <4baa27f2$0$6770$9b4e6d93@newsspool3.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 24 Mar 2010 15:55:46 CET
NNTP-Posting-Host: 0cf2e53c.newsspool3.arcor-online.net
X-Trace: 
 DXC=QV:oeHOo4AW\9P[:DUn00QMcF=Q^Z^V3X4Fo<]lROoRQ8kF<OcfhCO[HAQJ;JMblF]nc\616M64>ZLh>_cHTX3j]mRZM?2e<DlS
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news1.google.com comp.lang.ada:9735
Date: 2010-03-24T15:55:46+01:00
List-Id: <comp.lang.ada>

Dmitry A. Kazakov schrieb:
>  how the proposed algorithms map onto the
> Ada tasking model, especially taking into account that Ada tasking
> primitives are higher level, than ones known in other languages.

As a side note: it seems anything but easy to explain
the idea of a concurrent language, not a library, and
not CAS things either, as the means to support the programmer
who wishes to express concurrency.
Concurrency is not seen as one of the modes of expression
in language X. Rather, concurrency is seen as an effect
of interweaving concurrency primitives and some algorithm.

What can one do about this?