nice job with the slides! I have only one small point to criticize:
When PageRank is implemented with MapReduce, it's not necessary to have
the graph passed through in each iteration. Mahout for example uses
power iterations where the adjacency matrix is multiplied by the
pagerank vector and only that vector has to be sent over the network.
Pegasus uses a similar approach.
On 06.02.2012 12:24, Claudio Martella wrote:
> Hello guys,
> for those interested, here are the "slides" for my talk at FOSDEM.
> The event was very nice, a tight community and a great interest in
> Giraph. Isabel Drost, one of the organizers of Berlin Buzzwords,
> invited the talk there. Jakob, are you still planning to talk there?
> Maybe we can split Kafka/Giraph talks?