[
https://issues.apache.org/jira/browse/HAMA-571?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
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: https://issues.apache.org/jira/browse/HAMA-571
> 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.
> http://mail-archives.apache.org/mod_mbox/incubator-hama-user/201204.mbox/%3CCAJ-%3DysmSdYoX5t1pPjGi0KXWM%3DYVN2s8CoCgw5V3jXU3F74MHw%40mail.gmail.com%3E
> 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:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
