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
Path: 
 g2news2.google.com!news3.google.com!news4.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newsfeed00.sul.t-online.de!t-online.de!tiscali!newsfeed1.ip.tiscali.net!proxad.net!193.252.118.146.MISMATCH!news.wanadoo.fr!news.wanadoo.fr!not-for-mail
Message-ID: <45E9BEFC.3020202@obry.net>
Date: Sat, 03 Mar 2007 19:31:24 +0100
From: Pascal Obry <pascal@obry.net>
Organization: Home - http://www.obry.net
User-Agent: Thunderbird 2.0b2 (Windows/20070116)
MIME-Version: 1.0
Newsgroups: comp.lang.ada,comp.lang.vhdl
To: mailbox@dmitry-kazakov.de
Subject: Re: Embedded languages based on early Ada (from "Re: Preferred OS,
 processor family for running embedded Ada?")
References: <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.demon.co.uk.uk.uk>
 <1i3drcyut9aaw.isde6utlv6iq.dlg@40tude.net>
 <pan.2007.03.03.00.01.49.334@linuxchip.demon.co.uk.uk.uk>
 <1j0a3kevqhqal.riuhe88py2tq$.dlg@40tude.net>
 <camiu2tgii5qvtscjnl84kgr5d8hunu0ej@4ax.com>
 <q95ob4-082.ln1@rimmer.farnz.org.uk>
 <pan.2007.03.03.14.08.34.569578@linuxchip.demon.co.uk.uk.uk>
 <45E9B032.60502@obry.net> <1gu2cq68c8hr$.1264r2leozvow.dlg@40tude.net>
In-Reply-To: <1gu2cq68c8hr$.1264r2leozvow.dlg@40tude.net>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
NNTP-Posting-Date: 03 Mar 2007 19:31:41 CET
NNTP-Posting-Host: 82.120.29.64
X-Trace: 1172946701 news.orange.fr 25908 82.120.29.64:1723
X-Complaints-To: abuse@orange.fr
Xref: g2news2.google.com comp.lang.ada:9660 comp.lang.vhdl:7624
Date: 2007-03-03T19:31:41+01:00
List-Id: <comp.lang.ada>

Dmitry A. Kazakov a �crit :

> The idea (of PAR etc) is IMO quite opposite. It is about treating
> parallelism rather as a compiler optimization problem, than as a part of
> the domain. In the simplest possible form it can be illustrated on the
> example of Ada's "or" and "or else." While the former is potentially
> parallel, it has zero overhead compared to sequential "or else." (I don't
> count the time required to evaluate the operands). If we compare it with
> the overhead of creating tasks, we will see a huge difference both in terms
> of CPU cycles and mental efforts.

I don't buy this :) You don't have to create tasks for every
computations. You put in place a writer/consumer model. A task prepare
the data and put them into a list (protected object) and you have a set
of tasks to consume those jobs. This works in many cases, requires only
creation of tasks once (not as bad as OpenMP which creates threads for
parallel computations).

Pascal.

-- 

--|------------------------------------------------------
--| Pascal Obry                           Team-Ada Member
--| 45, rue Gabriel Peri - 78114 Magny Les Hameaux FRANCE
--|------------------------------------------------------
--|              http://www.obry.net
--| "The best way to travel is by means of imagination"
--|
--| gpg --keyserver wwwkeys.pgp.net --recv-key C1082595