incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Edward J. Yoon (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Wed, 11 May 2011 13:07:47 GMT

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

Edward J. Yoon commented on HAMA-359:
-------------------------------------

FYI, below initialization part takes ±10 minutes on 16 physical machines. Is there a reason
why use sendMessageToNeighbors() method?

{code}
+    // init the vertices
+    for (ShortestPathVertex v : adjacencyList.keySet()) {
+      if (v.equals(start)) {
+        v.setCost(0);
+      } else {
+        // INF
+        v.setCost(Integer.MAX_VALUE);
+      }
+      // initial message bypass
+      sendMessageToNeighbors(peer, v);
+    }
{code}

> 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

Mime
View raw message