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: a07f3367d7,6f24e26ea2e03c4
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news4.google.com!feeder2.cambriumusenet.nl!feed.tweaknews.nl!193.201.147.84.MISMATCH!xlned.com!feeder1.xlned.com!newsfeed.freenet.de!news.teledata-fn.de!newsfeed.arcor.de!newsspool3.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Wed, 24 Mar 2010 19:27:18 +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: Ada parallelism (was: 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>
 <4baa27f2$0$6770$9b4e6d93@newsspool3.arcor-online.net>
 <Xns9D4580FB5667EWarrensBlatherings@188.40.43.245>
In-Reply-To: <Xns9D4580FB5667EWarrensBlatherings@188.40.43.245>
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 7bit
Message-ID: <4baa5987$0$6762$9b4e6d93@newsspool3.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 24 Mar 2010 19:27:19 CET
NNTP-Posting-Host: cca1d7da.newsspool3.arcor-online.net
X-Trace: 
 DXC=;n>7MLRnVFcEB;5>eE0T7mMcF=Q^Z^V3h4Fo<]lROoRa8kF<OcfhCOkT?e;DYgePChnc\616M64>jLh>_cHTX3jmYClEd6ZLcDa
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:10715
Date: 2010-03-24T19:27:19+01:00
List-Id: <comp.lang.ada>

Warren schrieb:
> Georg Bauhaus expounded in news:4baa27f2$0$6770$9b4e6d93
> @newsspool3.arcor-online.net:
> 
>> 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?
> 
> I thought the Cilk project was rather interesting in
> their attempt to make C (and C++) more parallel
> to take advantage of multi-core cpus. But the language 
> still requires that the programmer program the parallel 
> aspects of the code with some simple language enhancements.
> 
> As cores eventually move to 128+-way cores, this needs
> to change to take full advantage of shortened elapsed
> times, obviously.  I think this might require a radical
> new high-level language to do it.  

Or efficient multicore Ada will have to go radically back to
the roots ;-)  How did they achieve efficient execution on
massively parallel processors? HPF? Occam? What do Sisal
implementations do?