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

[Colin Paul Gloster <Colin_Paul_Gloster@ACM.org>]

In news:pan.2007.03.03.17.00.07.159450@linuxchip.demon.co.uk.uk.uk
timestamped Sat, 03 Mar 2007 16:59:52 GMT, "Dr. Adrian Wrigley"
<amtw@linuxchip.demon.co.uk.uk.uk> posted:
"[..]
On Sat, 03 Mar 2007 15:26:35 +0000, Jonathan Bromley wrote:

[..]

> For the numerical-algorithms people, I suspect the problem of
> inferring opportunities for parallelism is nearer to being solved
> than some might imagine.  There are tools around that
> can convert DSP-type algorithms (such as the FFT that's
> already been mentioned) into hardware that's inherently

Again, this is ages old now.  But it can't convert
C-type programs reliably and efficiently.

> parallel; there are behavioural synthesis tools that allow
> you to explore the various possible parallel vs. serial
> possibilities for scheduling a computation on heterogeneous
> hardware.  It's surely a small step from that to distributing
> such a computation across multiple threads or CPUs.  All
> that's needed is the will.

[..]"


I am not aware of tools which automatically generate such parallel
implementations, though they may exist. For many algorithms a precise
implementation would be required, but for many numerical applications
in which absolute adherence is not required, are such tools so
impressive that they will replace Jacobi's method with the
Gauss-Seidel method (or something even better) without guidance?