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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,e0e1d3b3f7c994b8
X-Google-Attributes: gid103376,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII
Path: 
 g2news1.google.com!postnews.google.com!b5g2000pri.googlegroups.com!not-for-mail
From: Steve Whalen <SteveWhalen001@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Re: Robert Dewar's great article about the Strengths of Ada over
	other langauges in multiprocessing!
Date: Wed, 30 Apr 2008 19:03:42 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <1e262414-7769-49bd-96e0-615f1d517848@b5g2000pri.googlegroups.com>
References: <13t4b2kkjem20f3@corp.supernews.com>
 <89af8399-94fb-42b3-909d-edf3c98d32e5@n75g2000hsh.googlegroups.com>
	<fv6hqq$tbf$1@registered.motzarella.org>
NNTP-Posting-Host: 96.239.196.62
Mime-Version: 1.0
Content-Type: text/plain; charset=KOI8-R
Content-Transfer-Encoding: quoted-printable
X-Trace: posting.google.com 1209607422 21680 127.0.0.1 (1 May 2008 02:03:42
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Thu, 1 May 2008 02:03:42 +0000 (UTC)
Complaints-To: groups-abuse@google.com
Injection-Info: b5g2000pri.googlegroups.com; posting-host=96.239.196.62;
	posting-account=1DYAFwoAAACIDVYVTgt8S17hEoqe5uRH
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US;
 rv:1.8.1.14)
	Gecko/20080404 Firefox/2.0.0.14,gzip(gfe),gzip(gfe)
Xref: g2news1.google.com comp.lang.ada:21160
Date: 2008-04-30T19:03:42-07:00
List-Id: <comp.lang.ada>

On Apr 29, 12:15 am, Ivan Levashew <octag...@bluebottle.com> wrote:
> Maciej Sobczak =D0=C9=DB=C5=D4:> Take for example lock-free algorithms. Th=
ere is no visible research on
> > this related to Ada, unlike Java and C++ (check on
> > comp.programming.threads).
>
> FYI:http://www.gidenstam.org/Ada/Non-Blocking/index.html
>
> --
> If you want to get to the top, you have to start at the bottom

Thanks for the link. Very interesting ...