On Jun 25, 2009, at 9:42 PM, Mark Kerzner wrote:
my guess, as good as anybody's, is that Pregel is to large graphs is
what
Hadoop is to large datasets.
I think it is much more likely a language that allows you to easily
define fixed point algorithms. I would imagine a distributed
According to my understanding, I think the Pregel is in same layer
with MR, not a MR based language processor.
I think the 'Collective Communication' of BSP seems the core of the
problem. For example, this BFS problem
(http://blog.udanax.org/2009/02/breadth-first-search-mapreduce.html)
can
Hello,
I don't have a background in CS, but does MS's Dryad (
http://research.microsoft.com/en-us/projects/Dryad/ ) fit in anywhere
here?
Regards
Saptarshi
On Fri, Jun 26, 2009 at 5:19 AM, Edward J. Yoonedwardy...@apache.org wrote:
According to my understanding, I think the Pregel is in same
Hi all,
my guess, as good as anybody's, is that Pregel is to large graphs is what
Hadoop is to large datasets. In other words, Pregel is the next natural step
for massively scalable computations after Hadoop. And, as with MapReduce,
Google will talk about the technology but not give out the code
