incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Thomas Jungblut (JIRA)" <>
Subject [jira] [Updated] (HAMA-571) Provide graph repair function in GraphJobRunner
Date Wed, 16 May 2012 18:21:08 GMT


Thomas Jungblut updated HAMA-571:

    Attachment: HAMA-571_2.patch

haha, it was a bit more difficult, because we are added an additional sync in the code, therefore
some conditions failed (getSuperstepCount > 1). 
It is needed to rely on the tracked iteration count, not that sync. 

I put that into the testcases of connected components and pagerank. These are two distinct
cases, the last one needs self referencing on the edges.

Please review this!
> Provide graph repair function in GraphJobRunner
> -----------------------------------------------
>                 Key: HAMA-571
>                 URL:
>             Project: Hama
>          Issue Type: Improvement
>          Components: bsp core, graph
>            Reporter: Thomas Jungblut
>            Assignee: Thomas Jungblut
>         Attachments: HAMA-571_2.patch, HAMA-571_windows_first.patch
> As discussed here, we want to add a configurable checker that repairs maybe broken graph
adjacency lists.
> Currently each vertex addressed in an edge by the adjacency list is needed on the vertex
map somewhere in the cluster.
> If that vertex isn't available it will result in NullPointerExceptions.
> Pseudocode is attached in that mail archive.

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:!default.jspa
For more information on JIRA, see:


View raw message