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-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news4.google.com!feeder.news-service.com!news-out2.kabelfoon.nl!newsfeed.kabelfoon.nl!xindi.nntp.kabelfoon.nl!news.banetele.no!uio.no!newsfeed1.funet.fi!newsfeeds.funet.fi!nntp.inet.fi!inet.fi!fi.sn.net!newsfeed2.fi.sn.net!news.song.fi!not-for-mail Date: Fri, 14 Aug 2009 16:58:00 +0300 From: Niklas Holsti Organization: Tidorum Ltd User-Agent: Mozilla-Thunderbird 2.0.0.22 (X11/20090706) MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: C++0x and Threads - a poor relation to Ada's tasking model? References: <81a101a3-b46e-4268-973c-356c6119ee2b@c14g2000yqm.googlegroups.com> <2785ff1e-661b-41ce-95a8-cef2862e2907@b14g2000yqd.googlegroups.com> <6239906b-e952-4bf9-8a11-b7faf942bdde@k19g2000yqn.googlegroups.com> <270bf4df-4d0b-4621-9005-80ef8ab51634@s31g2000yqs.googlegroups.com> <08na85tgfqucfb21lq82fug7b4ctn0astl@4ax.com> In-Reply-To: Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Message-ID: <4a856d74$0$24772$4f793bc4@news.tdc.fi> NNTP-Posting-Host: 81.17.205.61 X-Trace: 1250258292 news.tdc.fi 24772 81.17.205.61:51946 X-Complaints-To: abuse@tdcnet.fi Xref: g2news2.google.com comp.lang.ada:7784 Date: 2009-08-14T16:58:00+03:00 List-Id: Dmitry A. Kazakov wrote: > I wonder if transputers will make a come back. Arguably a multi-core memory > sharing architecture is a dead end. Transputers had local memory. If they > return as systems with 1000 and more loosely coupled nodes (cores), what > will be a programming of look like? Ada's rendezvous will probably shine > again... The XMOS multi-core chips look like a born-again transputer system. See www.xmos.com. The CTO is David May of Transputer fame. But no Ada compiler so far, it seems. -- Niklas Holsti Tidorum Ltd niklas holsti tidorum fi . @ .