Graph Hama 0.6 Bug(?)

[Kostas Xirog <k0...@gmail.com>]

Hello,

 Can someone try running a graph hama program where the compute function
sends messages to all its neighbors and votes to halt? I tried it and I ran
into a problem. After the 3rd superstep, the program stops...

Anyone have any hints on why this may be happening? Any sort of Idea, help,
advice would be really helpful

Thank you in advance
Kostas X.

Re: Graph Hama 0.6 Bug(?)

[Ilias Kapouranis <ik...@csd.auth.gr>]

Mate there are almost no bugs when doing simple operations like this!
Please think a bit logically about your problem and don't give it away  
to a code bug.
First check to see if you have MaxIterations set to 3.
Then the logical part:
- First the messages are sent and each node votes to halt.
- At a superstep, a vote to halt from a node is cancelled if it has  
new incoming messages.
All we can do is guessing. If you don't post the full code, we can't  
do anything else.

Ilias K.

Quoting Kostas Xirog <k0...@gmail.com>:

> Hello,
>
>  Can someone try running a graph hama program where the compute function
> sends messages to all its neighbors and votes to halt? I tried it and I ran
> into a problem. After the 3rd superstep, the program stops...
>
> Anyone have any hints on why this may be happening? Any sort of Idea, help,
> advice would be really helpful
>
> Thank you in advance
> Kostas X.
>