HUG @ Hyderabad and Hama

[Praveen Sripati <pr...@gmail.com>]

Guys,

Last Saturday (23rd, July) I presented a session on `Graph Processing
Applications` @ HUG-Hyderabad and the response was very good. I also talked
briefly about Hama and Giraph. The audience were very interested in a
follow on session for a Hama demo with more technical details.

Besides pagerank, shortest path and bipartiate matching are there any other
graph algorithms implemented in Hama? I checked with Giraph and it also
doesn't have many algorithms implemented.

I would be able to run these algorithms on Hama and do a code walk through.
I can also talk about developing graph algorithms on Hama. If I need any
help in this regard, I will let you guys know.

I came across `Design and Analysis of BSP Algorithms` [1] in which some of
the algorithms have been implemented in the BSP model. I am planning to
implement some of the algorithms in Hama/Giraph. It would be nice to run a
couple of graph processing algorithms on top of Hama with some useful data
not only for this particular demo, but in fact for any demo.

BTW, it was nice to spread the word about Hama. There were around 80
attendees and I hope at least some of them will spread the word and get a
chance to try Hama.

Thanks,
Praveen

[1] - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.9247