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,e0e1d3b3f7c994b8
X-Google-Attributes: gid103376,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!news.germany.com!news.belwue.de!LF.net!news.enyo.de!not-for-mail
From: Florian Weimer <fw@deneb.enyo.de>
Newsgroups: comp.lang.ada
Subject: Re: Robert Dewar's great article about the Strengths of Ada over
 other langauges in multiprocessing!
Date: Sat, 22 Mar 2008 23:43:42 +0100
Message-ID: <87bq56peg1.fsf@mid.deneb.enyo.de>
References: <13t4b2kkjem20f3@corp.supernews.com>
	<89af8399-94fb-42b3-909d-edf3c98d32e5@n75g2000hsh.googlegroups.com>
	<fr4916$vo7$1@jacob-sparre.dk>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: idssi.enyo.de 1206225823 28356 212.9.189.177 (22 Mar 2008 22:43:43
 GMT)
X-Complaints-To: 
Cancel-Lock: sha1:GB8XsF76vV7kIDiY2oIw6yo1nvo=
Xref: g2news1.google.com comp.lang.ada:20551
Date: 2008-03-22T23:43:42+01:00
List-Id: <comp.lang.ada>

* Randy Brukardt:

> "Maciej Sobczak" <see.my.homepage@gmail.com> wrote in message
> news:89af8399-94fb-42b3-909d-edf3c98d32e5@n75g2000hsh.googlegroups.com...
> ...
>> Take for example lock-free algorithms. There is no visible research on
>> this related to Ada, unlike Java and C++ (check on
>> comp.programming.threads).
>
> Perhaps I'm showing my ignorance, but does there need to be any?

If you actually want to go thoroughly multi-core, you often need
non-blocking algorithms.  It is not possible to write them in Ada
because Ada lacks the required primitives (mainly compare-and-swap or
something equivalent).

> Ada supports lock-free threads quite well using pragma Atomic.

Try implementing Azul's concurrent hashtable in Ada:

<http://blogs.azulsystems.com/cliff/2007/03/a_nonblocking_h.html>

(Portable Java source code is available.)