incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Edward J. Yoon" <edwardy...@apache.org>
Subject Re: FYI, Large-scale graph computing at google.
Date Mon, 22 Jun 2009 06:28:38 GMT
Hmm, It sounds like Pregel seems a computing framework for the graph
using dynamic programming. And,

"In Pregel, programs are expressed as a sequence of iterations. In
each iteration, a vertex can, independently of other vertices, receive
messages sent to it in the previous iteration, send messages to other
vertices, modify its own and its outgoing edges' states, and mutate
the graph's topology"

They seems use the network communication instead of map/red
'intermediate file'. Check this out -- Bulk Synchronous Parallel Model
(http://en.wikipedia.org/wiki/Bulk_Synchronous_Parallel)

On Mon, Jun 22, 2009 at 11:59 AM, Edward J. Yoon<edwardyoon@apache.org> wrote:
> http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-at-google.html
>
> --
> Best Regards, Edward J. Yoon @ NHN, corp.
> edwardyoon@apache.org
> http://blog.udanax.org
>



-- 
Best Regards, Edward J. Yoon @ NHN, corp.
edwardyoon@apache.org
http://blog.udanax.org

Mime
View raw message