Mailing-List: contact hama-dev-help@incubator.apache.org; run by ezmlm
Precedence: bulk
Reply-To: hama-dev@incubator.apache.org
Date: Tue, 22 Mar 2011 10:23:05 +0000 (UTC)
From: "Edward J. Yoon (JIRA)" <jira@apache.org>
To: hama-dev@incubator.apache.org
Message-ID: 
 <1658274849.3546.1300789385889.JavaMail.tomcat@hel.zones.apache.org>
In-Reply-To: 
 <1094136074.652.1299492899376.JavaMail.tomcat@hel.zones.apache.org>
Subject: [jira] [Commented] (HAMA-359) Development of Shortest Path Finding
 Algorithm
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit


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

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

Note that you can freely design your own scenario. We'll help you! :-) 

For example, you can just focus on to show the advantages (e.g., sequential programming, scalable, performance, ..., etc) of using Hama BSP to graph computing.


> 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