hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Thomas Jungblut (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Thu, 24 Mar 2011 18:00:06 GMT

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

Thomas Jungblut commented on HAMA-359:

I read the papers about microsoft trinity Alois posted on Twitter. It was quite interesting.
Maybe we should need something equal to the graph database, HBase would be an option. But
since it is no more a requirement for Hama, I tend to write a SequenceFile Database. 
Storing byte offsets to a special lookup key or something..

Had a bit time and worked through Hama and BSP!
Never the less I have another question:
What is the advantage to use a "master groom" like in the PiEstimator example? I mean this
could turn into a large bottleneck. BSP uses the communication phase to communicate between
the nodes and not the nodes to a master node. Or did I missed something?


> 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

View raw message