incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Edward J. Yoon (JIRA)" <>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Mon, 28 Mar 2011 08:28:06 GMT


Edward J. Yoon commented on HAMA-359:

> 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?


In PiEstimator example, master task is one BSP processor of nodes, not a master server of
cluster. :)

> 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