I'd start by taking HBase out of the equation.
On Thu, May 8, 2014 at 1:46 PM, Pascal Jäger pas...@pascaljaeger.de wrote:
Hi all,
I have implemented a label propagation algorithm to find clusters in a
graph.
I just realized that the time the algorithm takes for one superstep is
increasing
Hi all,
I have implemented a label propagation algorithm to find clusters in a graph.
I just realized that the time the algorithm takes for one superstep is
increasing and I don’t know why.
The graph is static and the number of messages is the same throughout all
supersteps.
During every
