Hi all,
I'm running a minimum spanning tree compute function on Hadoop cluster (20
machines). After certain supersteps (e.g. superstep 47 for a graph of
4,194,304 vertices and 181,566,970 edges), the execution time increased
dramatically. This is not the only problem, the job has been killed "Task
After some more experimenting, I was able to get it to work. I figured I'd
share my results.
In my setup, I have a BooleanAndAggregator, which by default has a value of
true. I want to stop when all vertices vote to stop (even if there are new
messages sent). So, in a standard superstep each
Thank you both for the replies.
I have checked out the most recent version of the code and am still having the
same problem. (I also tried with the previous aggregator code with no luck
either.) Looking in the logs it appears that It gets through superstep -1, and
the block seems to occur on
Hi Nick,
There were some very recent changes in the way aggregators are used. If your
code below compiles it means that you are using the version before the changes,
and looking at the example after them. The code which Kaushik attached shows
how you should do it if you are not using the newest
