Jason Johnson wrote:

On 10/25/07, Matej Kosik <kosik@fiit.stuba.sk> wrote:

Anyone followed links that Andreas gave?


Yes, some of it.  Looks like it's based on the futures model.

  (Erlang does not solve these problems.


No one *solves* these problems, the actor model Erlang uses is just a
good way of dealing with most of the cases.

Hi,

"...most of the cases"? Hardly! It barely scratches the surface.

The "process-based model of concurrency" - as used in Erlang - is but one approach in a wide range of techniques that provide solutions for concurrency. It doesn't solve every problem in concurrency - I don't even think that they claim that for it. If they do please show us where.

Further the example of the one million object graph being processed by 10,000 compute nodes processing the problem is that you don't know in advance how to slice up the data. If you can know in advance how to slice up the data then you've simplified and possibly optimized the problem solving. However, that's the problem, slicing up real world data object sets that are highly interconnected with each other and processing them in parallel. That's an example of a more general case. There are other examples that won't compute with the slice em and dice em approach using the process-based model of concurrency.

Peter