Re: Embedded languages based on early Ada (from "Re: Preferred OS, processor family for running embedded Ada?")

[Pascal Obry <pascal@obry.net>]

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