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?
(-_-;)
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)
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)
[Note] Dijkstra's vs. Bellman-Ford
- Dijkstra's : relax each edge exactly once (can't handle negative weights)
- Bellman-Ford : relax each edge |V| -1 times
Anything else?
Subscribe to:
Posts (Atom)
-
Opening the black box of Deep Neural Networks via Information - https://arxiv.org/pdf/1703.00810.pdf 지금까지 딥 러닝은 어떻게 동작하는지 이해할 수 없다고 믿어져왔다...
-
음성 인공지능 분야에서 스타트업이 생각해볼 수 있는 전략은 아마 다음과 같이 3가지 정도가 있을 것이다: 독자적 Vertical 음성 인공지능 Application 구축 기 음성 플랫폼을 활용한 B2B2C 형태의 비지니스 구축 기 음성 플랫폼...
-
As mentioned ago, I've been forming up the Hamburg project with Hyunsik Choi. Let's see more detail in the diagram of computing met...