[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13012303#comment-13012303
]
Edward J. Yoon commented on HAMA-359:
-------------------------------------
Since current version of Hama doesn't provide an I/O API and data partitioner,
it might be hard to implement all.
As I mentioned above, please focus on understanding of the BSP model, and to
show the advantages (e.g., sequential programming, scalable, performance, ...,
etc) of using Hama BSP to graph computing.
Here's my example scenario:
1. You can create your own adjacency matrix of graph G on HBase.
2. Then, you can assign range 1-10 to task-1, 11-20 to task-2, ...
3. In bsp() function, you can scan the assigned range of HBase table.
> 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
> 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
