incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Alois Cochard (JIRA)" <>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Fri, 25 Mar 2011 10:19:05 GMT


Alois Cochard commented on HAMA-359:

Just want to add that Blueprints can't be used the way I was thinking, no 'data locality awareness'
(didn't find better way to express), it's just a simple layer to access a graphdb.

Even M/R algorithms David will develop gonna be tied to Hadoop/HBase, so we are...

But I'm still convinced about the usefulness of BSP on HBase as GraphDB.


> Development of Shortest Path Finding Algorithm
> ----------------------------------------------
>                 Key: HAMA-359
>                 URL:
>             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:

View raw message