At 2014-11-18 15:44:31 +0530, Deep Pradhan <pradhandeep1...@gmail.com> wrote:
> I meant to ask whether it gives the solution faster than other algorithms.
No, it's just that it's much simpler and easier to implement than the others.
Section 5.2 of the Pregel paper [1] justifies using it for a graph (a binary
tree) with 1 billion vertices on 300 machines:
More advanced parallel algorithms exist, e.g., Thorup [44] or the ∆-stepping
method [37], and have been used as the basis for special-purpose parallel
shortest paths implementations [12, 32]. Such advanced algorithms can also
be expressed in the Pregel framework. The simplicity of the implementation
in Figure 5, however, together with the already acceptable performance (see
Section 6), may appeal to users who can't do extensive tuning or
customization.
> What do you mean by distributed algorithms? Can we not use any algorithm on
> a distributed environment?
Any algorithm can be split up and run in a distributed environment, but because
inter-node coordination is expensive, that can be very inefficient. Distributed
algorithms in this context are ones that reduce coordination.
Ankur
[1] http://db.cs.berkeley.edu/cs286/papers/pregel-sigmod2010.pdf
---------------------------------------------------------------------
To unsubscribe, e-mail: user-unsubscr...@spark.apache.org
For additional commands, e-mail: user-h...@spark.apache.org
