incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Thomas Jungblut (JIRA)" <>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Mon, 09 May 2011 12:28:03 GMT


Thomas Jungblut commented on HAMA-359:

Thank you for testing this ;D
And I know exactly why. 
Because when distributing the data it will use this modulo function on peer.getAllPeerNames().
Since the ordering is not consistent on every groom, this will cause messages to get on the
wrong host and therefore nullpointers.

I gonna fix this now.
Should we put just the data loading into a JUnit test or what is your idea?

> 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
>            Assignee: Thomas Jungblut
>              Labels: gsoc, gsoc2011, mentor
>             Fix For: 0.3.0
>         Attachments: 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:

View raw message