GSoC, Implementation of single source shortest path using Hama

Despite the Hama project[1] is still under heavy construction, one of my GSoC students has excellently (or aggressively) finished implementing[2] his plan, "Implementation of single source shortest path using Hama"[3] and also started to contribute improvements to the Hama project. He used an algorithm described in Google Pregel paper[4], and it works nicely on my 2-rack cluster (512 cores).

But, more surprisingly, he is just 19 years old! :o When I was 19 years old?

  • JDK 1.1 released.
  • I first met the monster called Diablo[5].
  • I ridden bike.

(-_-;)

1. http://incubator.apache.org/hama
2. https://issues.apache.org/jira/browse/HAMA-359
3. http://wiki.apache.org/hama/SSSP
4. http://www-bd.lip6.fr/ens/grbd2011/extra/SIGMOD10_pregel.pdf
5. http://en.wikipedia.org/wiki/Diablo_(video_game)

No comments:

Post a Comment

무한의 세계

무한 집합의 크기 Cardinality , 즉 원소의 개수를 수학에서는 '농도'라고 말한다. 유한 집합의 크기는 그대로 원소의 개수 이지만, 무한 집합의 경우는 원소의 개수를 낱낱이 셈하는 것은 불가능하기 때문에 '농도'라...