[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13015992#comment-13015992
]
Thomas Jungblut commented on HAMA-359:
--------------------------------------
Checked in my first version of the BSP-Dijkstra. Working well.
This is not containing HBase, is just a "translation" of the sequential
algorithm. Going to extend this with the partioning idea.
The containing Hama jar is the new 3.0 build that contains my local runner, so
everbody just can run the main method in the dijkstra and see how the BSP works
:)
I guess, I should now wait for the actual coding period :D
> Development of Shortest Path Finding Algorithm
> ----------------------------------------------
>
> Key: HAMA-359
> URL: https://issues.apache.org/jira/browse/HAMA-359
> Project: Hama
> Issue Type: New Feature
> Components: examples
> Affects Versions: 0.2.0
> Reporter: Edward J. Yoon
> Assignee: Edward J. Yoon
> Labels: gsoc, gsoc2011, mentor
> Fix For: 0.3.0
>
> Original Estimate: 2016h
> Remaining Estimate: 2016h
>
> The goal of this project is development of parallel algorithm for finding a
> Shortest Path using Hama BSP.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
