Re: About Aggregators working

Thanks Ameya for your reply.. On Tue, Oct 29, 2013 at 12:21 AM, Ameya Vilankar wrote: > Hi, > The problem with the above scenario since all vertices will call vote to > halt, there will be no active vertices left for the next superstep since > none of the vertices receive a message. So, the prog

Re: About Aggregators working

Hi, The problem with the above scenario since all vertices will call vote to halt, there will be no active vertices left for the next superstep since none of the vertices receive a message. So, the program will terminate on zeroth superstep itself. If you want access to the output of the aggregator

Running Giraph with out of core messages and combiners at the same time

I have the following questions: 1. Can we use the following parameters: -D giraph.useOutOfCoreMessages=true and -D giraph.useBigDataIOForMessages=true at the same time. Can we use the unsafe serialization and the out of core messaging at the same time? 2. Also whenever I use the -D giraph.useOutOf

Re: About Giraph Design

You could implement the LineRank algorithm, which was proposed as a scalable substitute for betweeness centrality: http://www.cs.cmu.edu/~ukang/papers/CentralitySDM2011.pdf --sebastian On 28.10.2013 17:09, Jyoti Yadav wrote: > Thanks Sebastian for your reply. > If we want to implement Betweennes

Re: About Aggregators working

Please help.. Jyoti On Sun, Oct 27, 2013 at 9:14 PM, Jyoti Yadav wrote: > Anyone please reply.. > > > > On Sat, Oct 26, 2013 at 6:05 PM, Jyoti Yadav > wrote: > >> Hi.. >> I have one query in my mind..I don't know whether it is a silly question >> or not? >> But the question is >> >> Suppose th

Need help to run Giraph program..

Hi .. I want to run my own giraph program. I made some modification to already existiing SimpleShortestPathsComputation program. I compiled it and created a jar file. I gave following command. bin/hadoop jar $GIRAPH_HOME/giraph-examples/target/giraph-examples-1.1.0-SNAPSHOT-for-hadoop-0.20.203.0

Re: About Giraph Design

Thanks Sebastian for your reply. If we want to implement Betweenness Centrality algo then what should we do? Regards Jyoti On Mon, Oct 28, 2013 at 6:10 PM, Sebastian Schelter wrote: > Hi Jyoti, > > All-Pairs-Shortest-Path is a problem with a solution quadratic in the > number of vertices of th

Re: About Giraph Design

Hi Jyoti, All-Pairs-Shortest-Path is a problem with a solution quadratic in the number of vertices of the input graph. For a reasonably large graph, you cannot even store the result. For most algorithms that map well to systems like Giraph the amount of messages per iteration is linear in the num