giraph-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paolo Castagna <castagna.li...@googlemail.com>
Subject Re: Algorithms implemented in Giraph
Date Sun, 24 Jun 2012 16:32:13 GMT


Praveen Sripati wrote:
> Thanks Paolo.
> 
> I was not able to find much info on the algorithms implemented on top of
> Giraph. Just wanted to make sure I haven't missed anything.

Hi Praveen,
sure... there are a couple of examples in the Google's Pregel paper which
have not been included/implemented in Giraph. It might be interesting to
add those. :-)

Do you have a specific algorithm or use case related to Giraph in mind?

Paolo

> 
> Praveen
> 
> On Sun, Jun 24, 2012 at 2:44 PM, Paolo Castagna
> <castagna.lists@googlemail.com <mailto:castagna.lists@googlemail.com>>
> wrote:
> 
>     Hi Praveen,
>     to the best of my knowledge, there isn't yet extensive documentation on
>     algorithms implemented on top of Giraph.
> 
>     I had same question while ago and this is probably one of the first
>     things
>     people approaching Giraph want to do.
> 
>     There are a few simple examples here:
>     https://svn.apache.org/repos/asf/giraph/trunk/src/main/java/org/apache/giraph/examples/
>     you can start with: SimpleShortestPathsVertex.java,
>     SimplePageRankVertex.java
>     and ConnectedComponentsVertex.java.
> 
>     You can find documentation on how to run Giraph jobs at the end of
>     this page:
>     https://cwiki.apache.org/confluence/display/GIRAPH/Shortest+Paths+Example
> 
>     My 2 cents,
>     Paolo
> 
>     Praveen Sripati wrote:
>     > Hi,
>     >
>     > Where can I get the information of all the algorithms implemented
>     on top
>     > of Giraph and how to run them?
>     >
>     > Thanks,
>     > Praveen
> 
> 

Mime
View raw message