Re: basic question on Ada tasks and running on different cores

[NatarovVI <4KCheshireCat@gmail.com>]

> Sure, but I'm skeptical that the vast majority of programmers can deal
> with any programming language that has the level of non-determinism
> needed to support useful parallelism. Functional programming languages
> make this worse, if anything.

and again - "parallelism is not concurrency"
if first-course CMU students can write correct parallel programs, 
everybody can. right abstractions is the key.
read Robert Harper experience at existentialtypes.wordpress.com

> Secondly, I'm skeptical that any language attempting fine-grained
> parallelism can ever perform anywhere near as well as a language using
> coarse parallelism (like Ada) and deterministic sequential semantics for
> the rest. Any parallelism requires scheduling overhead, and that
> overhead is going to be a lot higher for the fine-grained case, simply
> because there is a lot more of it needed (even if it is conceptually
> simpler).

you really need 100% of performance? maybe you like write in asm?))
seriously, SISAL and NESL can automatically get good part of data 
parallelism, no magic here. and this will be enought for most programmers.
(high order functions will be requirement here, extending data 
parallelism to operations on functions)

p.s. best scheduling is no scheduling...

> going on today :-), I don't see it happening. I wouldn't mind being

it will happen)) and Ada - not only language without need for debugging.
Standard ML also.