incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Edward J. Yoon" <>
Subject Re: When to terminate the ShortestPath and the PageRank program?
Date Wed, 18 Apr 2012 07:52:39 GMT
Yes, boolean is enough.

In PR example, iteration 30 is just a arbitrary number. I had just
copy and paste Pregel example. Actually, program should run until
convergence is achieved. If you are saying about unit test of
PageRank, then +1.

On Wed, Apr 18, 2012 at 4:22 PM, Praveen Sripati
<> wrote:
> 1) I was looking in the ShortestPath#bsp() (1) on when the program gets out
> the main while loop. Not sure if I understood it properly, but it looks a
> bit complicated without much comments. Similar logic has been applied in
> the org.apache.hama.graph.GraphJobRunner#bsp() also.
> Basically, each of the bsp task should send a boolean to a master depending
> on any messages have been sent to other peers or not. The master if there
> is atleast one true from any one of the peer, will send a true back to all
> the peers to continue the processing. Or else the bsp task can send a
> boolean to all the peers instead of the master to avoid an additional
> sync(). It is as simple as that.
> The number of updates vertex which have been updated should not matter.
> What is the purpose of the updatesMade and the globalUpdateCounts integer
> variables?
> 2) Also, in the PageRank(2) the convergence is not tested, the program just
> goes through the loop maxIteration # of times. Is a test for convergence
> required in the graph package?
> Praveen
> (1) -
> (2) -

Best Regards, Edward J. Yoon

View raw message