[jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm

["Thomas Jungblut (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13027739#comment-13027739 ] 

Thomas Jungblut commented on HAMA-359:
--------------------------------------

Little update what I did the last two hours:

- Rewritten the GSoCDijkstra class in terms of fitting into HBase:
-- Did some fancy polymorphism to be able to test locally and use hbase on a cluster
--- added few interfaces and their implementations
-- remove the vertex class and just deal with the htable IDs to fit into the table layout


TODO:

- partitioning stuff (quite urgent)
- concrete hbase implementation
- vertexSet must be put into an abstraction layer in case of outsourcing into htable
-- currently this is just a hashmap representation of the original htable of the adjacency list
- Finish Output: make a more sophisticated method like every path from source with its cost
- afterwards do a full profiling of cpu and memory

> 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: Thomas Jungblut
>              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