[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13031688#comment-13031688
]
Thomas Jungblut edited comment on HAMA-359 at 5/11/11 1:25 PM:
---------------------------------------------------------------
We can initilize the vertex while we read the map, if the groom contains the
start vertex it can send the message to the neighbors.
I'll fix this.
BTW partitioning takes much time as well. Maybe we can start a MapReduce job
that distribute the keys to their buckets.. This would parallize the whole step
in some way.
was (Author: thomas.jungblut):
We can initilize the vertex while we read the map, if the groom contains
the start vertex it can send the message to the neighbors.
I'll fix this.
> 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
>
> Attachments: HAMA-359-v2.patch, HAMA-359.patch, eddie.patch
>
> 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
