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,1a44c40a66c293f3
X-Google-Thread: 1089ad,7e78f469a06e6516
X-Google-Attributes: gid103376,gid1089ad,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news3.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newsfeed00.sul.t-online.de!t-online.de!130.59.10.21.MISMATCH!kanaga.switch.ch!switch.ch!newsserver.news.garr.it!newsserver.cilea.it!not-for-mail
From: Colin Paul Gloster <Colin_Paul_Gloster@ACM.org>
Newsgroups: comp.lang.ada,comp.lang.vhdl
Subject: Re: Embedded languages based on early Ada (from "Re: Preferred OS,
 processor family for running embedded Ada?")
Date: 5 Mar 2007 15:23:54 GMT
Organization: CILEA
Message-ID: <eshcma$jdd$1@newsserver.cilea.it>
References: <1172192349.419694.274670@k78g2000cwa.googlegroups.com>
 <uslcxt1u7.fsf@stephe-leake.org>
 <1172239820.896603.222120@k78g2000cwa.googlegroups.com>
 <u649rx29a.fsf@stephe-leake.org> <nhn5b4-9b2.ln1@newserver.thecreems.com>
 <pan.2007.02.24.22.11.44.430179@linuxchip.demon.co.uk.uk.uk>
 <u7iu68eba.fsf@stephe-leake.org> <es4dl5$ve2$1@newsserver.cilea.it>
 <pan.2007.03.01.11.23.01.229462@linuxchip.demon.co.uk.uk.uk>
 <113ls6wugt43q$.cwaeexcj166j$.dlg@40tude.net>
 <pan.2007.03.02.11.36.51.700020@linuxchip.
NNTP-Posting-Host: docenti.ing.unipi.it
X-Trace: newsserver.cilea.it 1173108234 19885 131.114.28.20 (5 Mar 2007
 15:23:54 GMT)
X-Complaints-To: news@cilea.it
NNTP-Posting-Date: 5 Mar 2007 15:23:54 GMT
Xref: g2news2.google.com comp.lang.ada:9685 comp.lang.vhdl:7639
Date: 2007-03-05T15:23:54+00:00
List-Id: <comp.lang.ada>

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> posted on Fri, 2 Mar
   2007 17:32:26 +0100 :
"[..]

> I'm looking for something like Cilk, but even the concurrent loop
> (JPR's for I in all 1 .. n loop?) would be a help.

Maybe, just a guess, the functional decomposition rather than statements
could be more appropriate here. The alternatives would access their
arguments by copy-in and resynchronize by copy-out."


>From William J. Dally in 1999 on
HTTP://CVA.Stanford.edu/people/dally/ARVLSI99.ppt#299,37,Parallel%20Software:%20Design%20Strategy
:"[..]
- many for loops (over data,not time) can be forall
[..]"
Without reading that presentation thoroughly now, I remark that Dally
seemed to be supportive of Wrigley's finely grained parallelism.