[erlang-questions] Dryad or MapReduce in Erlang?

[Adam Lindberg]

Well, the algorithm itself (MapReduce) cannot choose servers dynamically, it
is coded somewhere in the framework what server are available, which servers
are down at the moment and which are busy. So I would say that even
MapReduce (don't know about Dryad) needs to know these things. Of course you
can probably just hand it a list of servers and it gets going, but it would
be the same for any Erlang application implemented in the same way.

Cannot point you to any dynamic load distribution applications in Erlang at
the moment, sorry. Should be some out there...

There is a implementation of the lists module (containing functions like map
and foldl [reduce]) that is paralell on a local Erlang node (i.e. multi core
processors), plists: http://code.google.com/p/plists/

Shouldn't be so much work to implement distributed, over several nodes.

Cheers!
Adam

On Dec 10, 2007 11:53 PM, Raoul Duke <raould@REDACTED> wrote:

> (haven't managed to find this talked about yet, sorry if this is old
> material.) One interesting thing about Map Reduce and Dryad is that, I
> think, they can dynamically choose how many machines and processes are
> involved in servicing the high-level plan. Are there things in the
> Erlang world with similar abilities of abstraction? So far I've been
> under the impression that most Erlang applications know ahead of time
> the intended distribution of things.
>
> thanks for any edification,
> -An ever Erlang newbie.
> _______________________________________________
> erlang-questions mailing list
> erlang-questions@REDACTED
> http://www.erlang.org/mailman/listinfo/erlang-questions
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20071211/41577e75/attachment.htm>