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!news2.google.com!news4.google.com!border1.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!cyclone1.gnilink.net!gnilink.net!news-out.ntli.net!newsrout1-gui.ntli.net!ntli.net!news.highwinds-media.com!newspeer1-win.ntli.net!newsfe6-gui.ntli.net.POSTED!53ab2750!not-for-mail From: "Dr. Adrian Wrigley" Subject: Re: Embedded languages based on early Ada (from "Re: Preferred OS, processor family for running embedded Ada?") User-Agent: Pan/0.14.2 (This is not a psychotic episode. It's a cleansing moment of clarity.) Message-Id: Newsgroups: comp.lang.ada,comp.lang.vhdl References: <1172192349.419694.274670@k78g2000cwa.googlegroups.com> <1172239820.896603.222120@k78g2000cwa.googlegroups.com> <113ls6wugt43q$.cwaeexcj166j$.dlg@40tude.net> MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit Date: Tue, 06 Mar 2007 00:31:18 GMT NNTP-Posting-Host: 82.21.99.109 X-Trace: newsfe6-gui.ntli.net 1173141078 82.21.99.109 (Tue, 06 Mar 2007 00:31:18 GMT) NNTP-Posting-Date: Tue, 06 Mar 2007 00:31:18 GMT Organization: NTL Xref: g2news2.google.com comp.lang.ada:9695 comp.lang.vhdl:7647 Date: 2007-03-06T00:31:18+00:00 List-Id: On Mon, 05 Mar 2007 15:23:54 +0000, Colin Paul Gloster wrote: > "Dmitry A. Kazakov" 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. I hadn't seen that presentation, but a number of other key points are made by Dally: ------------------------------------- # Writing parallel software is easy * with good mechanisms # Almost all demanding problems have ample parallelism # Need to focus on fundamental problems * extracting parallelism * load balance * locality o load balance and locality can be covered by excess parallelism Conclusion: We are on the threshold of the explicitly parallel era * Diminishing returns from sequential processors (ILP) o no alternative to explicit parallelism * Enabling technologies have been proven o interconnection networks, mechanisms, cache coherence * Fine-grain machines are more efficient than sequential machines # Fine-grain machines will be constructed from multi-processor/DRAM chips # Incremental migration to parallel software ----------------------------------- Good to find *somebody* agrees with me! Shame Ada isn't leading the pack :( -- Adrian