Re: Trying to implement program to find betweenness centrality in giraph

2013-02-08 Thread Sebastian Schelter
How large is the graph for which you are trying to compute betweeness centrality? On 08.02.2013 13:22, Claudio Martella wrote: > Unfortunately there is no way to disable the counter limit completely. > Counters are very expensive as they require the jobtracker to keep a lot of > information for th

Re: Trying to implement program to find betweenness centrality in giraph

2013-02-08 Thread Claudio Martella
Unfortunately there is no way to disable the counter limit completely. Counters are very expensive as they require the jobtracker to keep a lot of information for the whole duration of the job (it is the jobtracker that is aggregating the counters from each tasktracker). Fortunately, many real-worl

Re: Trying to implement program to find betweenness centrality in giraph

2013-02-08 Thread Jan van der Lugt
@Claudio: Sorry I wasn't clear, I meant it is inherent that every step in BFS will cost you a superstep and a complete iteration over the graph. In other programming paradigms (like a C program with a bunch of pointers) this traversal could be implemented more efficiently. On Fri, Feb 8, 2013 at 2